Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058000
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058000 a(n) is smallest prime such that a(n)+1 is a proper multiple of a(n-1)+1 [with a(1)=1]. +0
2
1, 3, 7, 23, 47, 191, 383, 1151, 6911, 27647, 138239, 691199, 3455999, 34559999, 138239999, 414719999, 2073599999, 16588799999, 364953599999, 4744396799999, 66421555199999, 132843110399999, 664215551999999, 3321077759999999 (list; graph; listen)
OFFSET

1,2

FORMULA

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

CROSSREFS

Cf. A036013, A057999.

Sequence in context: A079477 A014426 A054270 this_sequence A002715 A112052 A127178

Adjacent sequences: A057997 A057998 A057999 this_sequence A058001 A058002 A058003

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research