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.

A272006 a(n) = A003617(n) - A062397(n-1).

Original entry on oeis.org

0, 0, 0, 8, 6, 2, 2, 18, 6, 6, 18, 2, 38, 36, 30, 36, 60, 2, 2, 50, 38, 116, 8, 116, 6, 12, 66, 102, 330, 318, 56, 32, 48, 60, 192, 68, 66, 42, 132, 2, 120, 108, 62, 56, 30, 8, 120, 32, 192, 8, 150, 120, 326, 170, 30, 20, 2, 278, 158, 18, 6, 92, 446, 120, 56, 48, 48, 48, 98, 8, 32, 272, 38, 78, 206
Offset: 1

Views

Author

Carauleanu Marc, Jul 13 2016

Keywords

Examples

			For n=4, the smallest 4-digit prime is 1009, and 10^(4-1) + 1 = 1001, so a(4) = 1009 - 1001 = 8. - _Michael B. Porter_, Aug 01 2016
		

Crossrefs

Programs

  • Mathematica
    Table[NextPrime[#] - (# + 1) &[10^(n - 1)], {n, 75}] (* Michael De Vlieger, Jul 13 2016 *)
  • PARI
    a(n) = nextprime(10^(n-1)) - (10^(n-1) +  1); \\ Michel Marcus, Jul 28 2016

Formula

a(n) = A033873(n-1) - 1. - Michel Marcus, Jul 28 2016