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.

Showing 1-3 of 3 results.

A013713 a(n) = 8^(2n+1).

Original entry on oeis.org

8, 512, 32768, 2097152, 134217728, 8589934592, 549755813888, 35184372088832, 2251799813685248, 144115188075855872, 9223372036854775808, 590295810358705651712, 37778931862957161709568, 2417851639229258349412352
Offset: 0

Views

Author

Keywords

Comments

Additive digital root of a(n) = 8. - Miquel Cerda, Jul 03 2016

Crossrefs

Programs

Formula

a(n) = 64a(n-1), n>0. O.g.f.: 8/(1-64x). - R. J. Mathar, May 07 2008
a(n) = 8*A089357(n) = 2*A013734(n) = A013735(n)/2 . - Philippe Deléham, Nov 24 2008
From Ilya Gutkovskiy, Jul 03 2016: (Start)
E.g.f.: 8*exp(64*x).
a(n) = A001018(A005408(n)). (End)

A013732 a(n) = 3^(3*n + 1).

Original entry on oeis.org

3, 81, 2187, 59049, 1594323, 43046721, 1162261467, 31381059609, 847288609443, 22876792454961, 617673396283947, 16677181699666569, 450283905890997363, 12157665459056928801, 328256967394537077627, 8862938119652501095929
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

Formula

From Philippe Deléham, Nov 25 2008: (Start)
a(n) = 27*a(n-1); a(0)=3.
G.f.: 3/(1-27*x). (End)

A013735 a(n) = 4^(3*n+2).

Original entry on oeis.org

16, 1024, 65536, 4194304, 268435456, 17179869184, 1099511627776, 70368744177664, 4503599627370496, 288230376151711744, 18446744073709551616, 1180591620717411303424, 75557863725914323419136, 4835703278458516698824704
Offset: 0

Views

Author

Keywords

Comments

Additive digital root of a(n) = 7. - Miquel Cerda, Jul 03 2016

Crossrefs

Programs

Formula

G.f.: 16/(1-64*x). - Philippe Deléham, Nov 24 2008
From Ilya Gutkovskiy, Jul 03 2016: (Start)
E.g.f.: 16*exp(64*x).
a(n) = A000302(A016789(n)). (End)
a(n) = 64*a(n-1). - Miquel Cerda, Oct 28 2016
Showing 1-3 of 3 results.