login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058000 a(n) is smallest prime such that a(n)+1 is a proper multiple of a(n-1)+1 [with a(1)=1]. 1
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; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..24.

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 * A246497 A002715 A112052

Adjacent sequences:  A057997 A057998 A057999 * A058001 A058002 A058003

KEYWORD

nonn

AUTHOR

Henry Bottomley, Nov 02 2000

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 18 11:25 EDT 2019. Contains 325138 sequences. (Running on oeis4.)