cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A134208 a(n) = A134207(n) + A134207(n-1).

Original entry on oeis.org

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
Offset: 1

Views

Author

Leroy Quet, Oct 14 2007

Keywords

Comments

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

Crossrefs

Programs

  • 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, Oct 17 2007 *)

Extensions

More terms from Stefan Steinerberger, Oct 17 2007