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.

A123867 a(n) = n^10 - 1.

Original entry on oeis.org

0, 1023, 59048, 1048575, 9765624, 60466175, 282475248, 1073741823, 3486784400, 9999999999, 25937424600, 61917364223, 137858491848, 289254654975, 576650390624, 1099511627775, 2015993900448, 3570467226623, 6131066257800, 10239999999999, 16679880978200
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 16 2006

Keywords

Comments

a(n) mod 11 = 0 iff n mod 11 > 0; a(A008593(n)) = 10.

Crossrefs

Programs

Formula

From G. C. Greubel, Aug 08 2019: (Start)
G.f.: x^2*(1023 + 47795*x + 455312*x^2 + 1310144*x^3 + 1310606*x^4 + 454982*x^5 + 47960*x^6 + 968*x^7 + 11*x^8 + x^9)/(1-x)^11.
E.g.f.: 1 +(-1 + x + 511*x^2 + 9330*x^3 + 34105*x^4 + 42525*x^5 + 22827*x^6 + 5880*x^7 + 750*x^8 + 45*x^9 + x^10)*exp(x). (End)