Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069565
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1, 2, 3, 10, 21, 22, 221, 0, 2432, 9729, 19459, 136214, 1770783, 10624699, 446237359, 8478509822, 195005725907, 5655166051304, 90482656820865, 2171583763700761, 86863350548030441, 1216086907672426175 (list; graph; listen)
OFFSET

0,2

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: A089791 A141050 A079161 this_sequence A139694 A064497 A161522

Adjacent sequences: A069562 A069563 A069564 this_sequence A069566 A069567 A069568

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 23 2002

EXTENSIONS

Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 27 2002

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research