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.

A069102 a(1) = 1; a(2) = 1; a(n) = Prime[n-1] + Prime[n-2] if n > 2.

Original entry on oeis.org

1, 1, 5, 8, 12, 18, 24, 30, 36, 42, 52, 60, 68, 78, 84, 90, 100, 112, 120, 128, 138, 144, 152, 162, 172, 186, 198, 204, 210, 216, 222, 240, 258, 268, 276, 288, 300, 308, 320, 330, 340, 352, 360, 372, 384, 390, 396, 410, 434, 450, 456, 462, 472, 480, 492, 508
Offset: 1

Views

Author

Joseph L. Pe, Apr 06 2002

Keywords

Examples

			a(3) = Prime[2] + Prime[1] = 3 + 2 = 5.
		

Crossrefs

Programs

  • Mathematica
    Join[{1,1},Total/@Partition[Prime[Range[60]],2,1]] (* Harvey P. Dale, Feb 01 2024 *)
  • PARI
    print1("1,1,"); for(n=1,100,print1(prime(n)+prime(n+1)","))

Extensions

More terms from Ralf Stephan, Mar 20 2003