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.

A034496 Sum of n-th powers of divisors of 8.

Original entry on oeis.org

4, 15, 85, 585, 4369, 33825, 266305, 2113665, 16843009, 134480385, 1074791425, 8594130945, 68736258049, 549822930945, 4398314962945, 35185445863425, 281479271743489, 2251816993685505, 18014467229220865
Offset: 0

Views

Author

Keywords

Comments

Conjecture: No primes in this sequence (checked for first 10000 terms). [Artur Jasinski, Sep 23 2008]
All terms are composite because a(n) = (1 + 2^n)*(1 + 4^n). [T. D. Noe, Apr 26 2010]

Crossrefs

Programs

Formula

G.f.: (4 - 45*x + 140*x^2 - 120*x^3)/((1 - 8*x)*(1 - 4*x)*(1 - 2*x)*(1 - x)). [Bruno Berselli, Apr 17 2014]
a(n) = (2^(4*n) - 1)/( 2^n - 1) = 1 + 2^n + 4^n + 8^n. Exp( Sum_{n >= 1} a(n)*x^n/n ) = 1 + 15*x + 155*x^2 + 1395*x^3 + ... is the o.g.f. for the 3rd subdiagonal of triangle A022166, essentially A006096. - Peter Bala, Apr 07 2015