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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069565 a(0) = 1, a(n) = k*a(n-1) + 1 is a multiple of n-th prime. If no such number exists then a(n) = 0 and a(n+1) = k*a(n-1) + 1 is a multiple of (n+1)-th prime; i.e., a(r) = smallest multiple of the r-th prime = k* a(s) + 1 where a(s) is the last nonzero term. 0
1, 2, 3, 10, 21, 22, 221, 0, 2432, 9729, 19459, 136214, 1770783, 10624699, 446237359, 8478509822, 195005725907, 5655166051304, 90482656820865, 2171583763700761, 86863350548030441, 1216086907672426175 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..21.

EXAMPLE

a(6) = 221 = 13*17. Hence there exists no number of the form k*221 + 1 which can be divisible by 17. Hence a(7) = 0 and a(8) = 2432 = 11*221 + 1 is divisible by 19.

CROSSREFS

Cf. A069563, A069563, A069564.

Sequence in context: A252868 A225477 A079161 * A139694 A064497 A161522

Adjacent sequences:  A069562 A069563 A069564 * A069566 A069567 A069568

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Mar 23 2002

EXTENSIONS

More terms from Robert G. Wilson v, Mar 27 2002

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 August 20 20:50 EDT 2019. Contains 326155 sequences. (Running on oeis4.)