Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A046966
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A046966 a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) + 1 is prime. +0
17
1, 2, 3, 5, 6, 9, 12, 16, 22, 25, 29, 31, 35, 47, 57, 61, 66, 79, 81, 108, 114, 148, 163, 172, 185, 198, 203, 205, 236, 265, 275, 282, 294, 312, 344, 359, 377, 397, 398, 411, 427, 431, 493, 512, 589, 647, 648, 660, 708, 719, 765, 887, 911, 916, 935, 1062, 1093 (list; graph; listen)
OFFSET

1,2

REFERENCES

H. Dubner, Recursive Prime Generating Sequences, Table 4 pp. 173 Journal of Recreational Mathematics 29(3) 1998 Baywood NY.

LINKS

T. D. Noe, Table of n, a(n) for n=1..200

EXAMPLE

1*2*3*5 + 1 = 31 is prime.

CROSSREFS

Cf. A046972.

Sequence in context: A008768 A067593 A084993 this_sequence A035948 A166048 A094873

Adjacent sequences: A046963 A046964 A046965 this_sequence A046967 A046968 A046969

KEYWORD

nonn,nice

AUTHOR

G. L. Honaker, Jr. (honak3r(AT)gmail.com)

EXTENSIONS

More terms from Jason Earls (zevi_35711(AT)yahoo.com), Jan 25 2002

Definition corrected by T. D. Noe, Feb 14 2007

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research