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.

A271590 First differences of column n of A271589 for arbitrarily large n.

Original entry on oeis.org

3, 4, 2, 3, 4, 11, 1, 2, 4, 2, 3, 4, 12, 26, 3, 4, 2, 1, 2, 4, 11, 1, 2, 4, 2, 3, 4, 12, 36, 71, 3, 4, 2, 3, 4, 11, 1, 2, 4, 2, 1, 2, 4, 12, 26, 3, 4, 2, 1, 2, 4, 11, 1, 2, 4, 2, 3, 4, 12, 36, 108, 206, 3, 4, 2, 3, 4, 11, 1, 2, 4, 2, 3, 4, 12, 26, 3, 4, 2, 1
Offset: 1

Views

Author

Max Barrentine, Apr 10 2016

Keywords

Crossrefs

Formula

For all k>2:
a(A000295(k)) = a(A000295(k+1)) = 3;
For A000295(k)
For n = 2^k-2, a(n) = a(n+2^(k+1)-1), a(2^(k+1)-2) = a(n)+5*3^(k-2);
a(2^(k+1)-3) = 4*3^(k-2);
For 2^k-2A079583(k-1)-1, a(n) = a(n+2^k)=a(n+2^(k+1)-1);
For n = A079583(k-1)-1, a(n) = a(n+2^(k+1)-1) = 1;
For n = A079583(k-1), a(n) = a(n+2^(k+1)-1) = 2;
a(A079583(k-1)+2^k-1) = 3;
For A079583(k-1)A000295(k+1), a(n) = a(n+2^k-1) = a(n+2^(k+1)-1)