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.

A248913 A248614(n+1) - A248614(n).

Original entry on oeis.org

1, 1, 2, 2, 4, 2, 4, 2, 2, 2, 6, 2, 6, 4, 2, 2, 2, 2, 4, 6, 2, 6, 4, 2, 6, 2, 2, 2, 4, 2, 2, 4, 4, 2, 4, 2, 2, 2, 4, 4, 6, 4, 2, 4, 2, 2, 4, 4, 2, 6, 6, 2, 2, 6, 2, 2, 2, 2, 10, 2, 4, 2, 2, 4, 4, 2, 2, 4, 4, 2, 4, 2, 2, 2, 2, 4, 2, 6, 4, 2, 4, 4, 2, 2, 4, 2
Offset: 0

Views

Author

Paul Curtz, Oct 16 2014

Keywords

Comments

From Bernoulli numbers A027642.
The first different numbers of a(n), i.e., 1, 2, 4, 6, 10, ... = A248614(1, 2, 3, 4, 5, ...) are at rank 0, 2, 4, 10, 58, ... .

Crossrefs

Programs

  • PARI
    lista() = {vbden = readvec("c:/gp/bfiles/b027642.txt"); vredu = readvec("c:/gp/bfiles/b090126.txt"); vrank = []; for (i=1, #vredu, val = vredu[i]; k = 1; while(vbden[k] != val, k++); vrank = concat(vrank, k-1);); for (i=2, #vrank, print1(vrank[i] - vrank[i-1], ", "););} \\ Michel Marcus, Nov 08 2014

Extensions

More terms from Michel Marcus, Nov 08 2014