Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057999
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057999 a(n) is smallest prime such that a(n)-1 is a proper multiple of a(n-1)-1 [with a(0)=2]. +0
2
2, 3, 5, 13, 37, 73, 433, 1297, 2593, 10369, 72577, 508033, 1524097, 12192769, 73156609, 146313217, 438939649, 2633637889, 23702740993, 142216445953, 1991030243329, 37829574623233, 416125320855553 (list; graph; listen)
OFFSET

0,1

FORMULA

a(n)= Product{i=1_n}[A036012(i)]+1 =a(n-1)*A036012(n)+1-A036012(n)

CROSSREFS

Cf. A036012, A046966, A046972, A058000.

Sequence in context: A072999 A141179 A079147 this_sequence A013013 A087362 A038560

Adjacent sequences: A057996 A057997 A057998 this_sequence A058000 A058001 A058002

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Nov 02 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research