[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A073680 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
a(1) =2, a(2) = 3, a(n+2) = smallest prime such that a(n+2) - a(n+1) is a multiple of a(n).
(history; published version)
#10 by N. J. A. Sloane at Fri Jul 18 22:28:48 EDT 2014
STATUS

proposed

approved

#9 by Franklin T. Adams-Watters at Fri Jul 18 13:04:51 EDT 2014
STATUS

editing

proposed

#8 by Franklin T. Adams-Watters at Fri Jul 18 13:03:07 EDT 2014
CROSSREFS
STATUS

approved

editing

#7 by N. J. A. Sloane at Thu Dec 05 19:55:31 EST 2013
AUTHOR

_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Aug 11 2002

Discussion
Thu Dec 05
19:55
OEIS Server: https://oeis.org/edit/global/2075
#6 by Russ Cox at Sat Mar 31 10:23:25 EDT 2012
EXTENSIONS

More terms from _Phil Carmody (pc+oeis(AT)asdf.org), _, Aug 15 2002

Discussion
Sat Mar 31
10:23
OEIS Server: https://oeis.org/edit/global/375
#5 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

T. D. Noe, <a href="/A073680/b073680.txt">Table of n, a(n) for n=1..100</a>

KEYWORD

nonn,new

nonn

#4 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
LINKS

T. D. Noe, <a href="http://www.research.att.com/~njas/sequences/b073680.txt">Table of n, a(n) for n=1..100</a>

KEYWORD

nonn,new

nonn

#3 by N. J. A. Sloane at Sat Nov 10 03:00:00 EST 2007
LINKS

T. D. Noe, <a href="http://www.research.att.com/~njas/sequences/b073680.txt">Table of n, a(n) for n=1..100</a>

CROSSREFS

Cf. A072999

KEYWORD

nonn,new

nonn

#2 by N. J. A. Sloane at Fri May 11 03:00:00 EDT 2007
KEYWORD

nonn,new

nonn

EXTENSIONS

More terms from Phil Carmody (pc+oeis(AT)adsfasdf.org), Aug 15 2002

#1 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
NAME

a(1) =2, a(2) = 3, a(n+2) = smallest prime such that a(n+2) - a(n+1) is a multiple of a(n).

DATA

2, 3, 5, 11, 31, 53, 239, 557, 7727, 11069, 88339, 110477, 1347223, 2672947, 8061839, 24099521, 362696759, 2483454607, 7561209233, 67164119801, 520836673781, 923821392587, 4048841435273, 7744127005621, 129209370063811

OFFSET

1,1

COMMENTS

One might call them Fibonacci-type primes.

EXAMPLE

a(6)-a(5) = 53-31 = 22 is a multiple of 11 = a(4).

PROG

(PARI) l=2; h=3; print("2, 3, "); while(l<2^128, t=l+h; while(!isprime(t), t+=l); print1(t, ", "); l=h; h=t)

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 11 2002

EXTENSIONS

More terms from Phil Carmody (pc(AT)adsf.org), Aug 15 2002

STATUS

approved