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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119759 a(1) = 1; a(n) is the smallest number k bigger than a(n-1) such that k*A002110(n)^3 - 1 is prime. 1
1, 2, 4, 9, 15, 23, 30, 37, 41, 47, 49, 53, 57, 59, 66, 74, 76, 88, 95, 101, 158, 166, 170, 248, 332, 333, 358, 415, 433, 458, 461, 466, 479, 481, 572, 748, 812, 883, 901, 935, 981, 1152, 1173, 1214, 1409, 1472, 1499, 1527, 1596, 1721, 1752 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

MATHEMATICA

a = {1}; For[n = 2, n < 41, n++, k = a[[ -1]] + 1; While[ !PrimeQ[ k*Product[Prime[i], {i, 1, n}]^3 - 1], k++ ]; AppendTo[a, k]]; a

CROSSREFS

Cf. A119760.

Sequence in context: A058296 A022948 A025217 * A026036 A072846 A157254

Adjacent sequences:  A119756 A119757 A119758 * A119760 A119761 A119762

KEYWORD

nonn

AUTHOR

Pierre CAMI, Jun 18 2006

EXTENSIONS

Edited by Stefan Steinerberger, Aug 13 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 19 19:50 EDT 2013. Contains 226416 sequences.