Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134208
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134208 a(n) = A134207(n) + A134207(n-1). +0
3
5, 8, 12, 20, 30, 36, 42, 64, 108, 140, 176, 216, 286, 364, 390, 432, 510, 558, 760, 1000, 1092, 1188, 1426, 1632, 1650, 1690, 1782, 1848, 2146, 2520, 2790, 2976, 3102, 3366, 3780, 4140, 4292, 4446, 4914, 5360, 5822, 6300, 6450, 6776, 7110, 7360, 7614, 7728 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n) is divisible by n for every n.

MATHEMATICA

a = {2}; For[n = 1, n < 100, n++, i = 1; While[Not[Mod[a[[ -1]] + Prime[PrimePi[a[[ -1]]] + i], n] == 0], i++ ]; AppendTo[a, Prime[PrimePi[ a[[ -1]]] + i]]]; c = {}; For[b = 1, b < Length[a], b++, AppendTo[c, a[[b]] + a[[b + 1]]]]; c - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 17 2007

CROSSREFS

Cf. A134207, A134209.

Sequence in context: A120135 A134650 A134205 this_sequence A115072 A114644 A138051

Adjacent sequences: A134205 A134206 A134207 this_sequence A134209 A134210 A134211

KEYWORD

nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Oct 14 2007

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 17 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 December 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research