login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090302 Begin with n and consider numbers obtained by successively subtracting 0, 1, 2, 3, ...; a(n) = largest prime that arises in the process, i.e., largest prime of the form n - T(r), where T(r) is the r-th triangular number; or 0 if no such number exists. 2

%I #7 Dec 26 2016 15:28:18

%S 0,2,3,3,5,5,7,7,3,7,11,11,13,13,5,13,17,17,19,19,11,19,23,23,19,23,

%T 17,13,29,29,31,31,23,31,29,0,37,37,29,37,41,41,43,43,17,43,47,47,43,

%U 47,41,37,53,53,19,53,47,43,59,59,61,61,53,61,59,11,67,67,59,67,71

%N Begin with n and consider numbers obtained by successively subtracting 0, 1, 2, 3, ...; a(n) = largest prime that arises in the process, i.e., largest prime of the form n - T(r), where T(r) is the r-th triangular number; or 0 if no such number exists.

%C a(p) = p if p is a prime.

%H T. D. Noe, <a href="/A090302/b090302.txt">Table of n, a(n) for n = 1..10000</a>

%F Largest prime of the form n - r(r+1)/2.

%Y Cf. A076768 (positions of 0's).

%Y Cf. A132399.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Nov 30 2003

%E More terms from _Frank Ellermann_, Dec 03 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 3 02:34 EDT 2024. Contains 375649 sequences. (Running on oeis4.)