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.

A213246 Number of nonzero elements in GF(2^n) that are 9th powers.

Original entry on oeis.org

1, 1, 7, 5, 31, 7, 127, 85, 511, 341, 2047, 455, 8191, 5461, 32767, 21845, 131071, 29127, 524287, 349525, 2097151, 1398101, 8388607, 1864135, 33554431, 22369621, 134217727, 89478485, 536870911, 119304647, 2147483647, 1431655765, 8589934591, 5726623061, 34359738367, 7635497415
Offset: 1

Views

Author

Joerg Arndt, Jun 07 2012

Keywords

Crossrefs

Cf. A213243 (cubes), A213244 (5th powers), A213245 (7th powers), A213247 (11th powers), A213248 (13th powers).

Programs

Formula

a(n) = M / gcd( M, 9 ), where M=2^n-1.
Conjectures from Colin Barker, Aug 23 2014: (Start)
a(n) = 65*a(n-6)-64*a(n-12).
G.f.: x*(2*x^2 -x +1)*(16*x^8 +16*x^7 +28*x^6 +16*x^5 +25*x^4 +8*x^3 +7*x^2 +2*x +1) / ((x -1)*(x +1)*(2*x -1)*(2*x +1)*(x^2 -x +1)*(x^2 +x +1)*(4*x^2 -2*x +1)*(4*x^2 +2*x +1)). (End)
Conjectures verified by Robert Israel, Jun 27 2018.