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.

A123868 a(n) = n^12 - 1.

Original entry on oeis.org

0, 4095, 531440, 16777215, 244140624, 2176782335, 13841287200, 68719476735, 282429536480, 999999999999, 3138428376720, 8916100448255, 23298085122480, 56693912375295, 129746337890624, 281474976710655, 582622237229760, 1156831381426175, 2213314919066160
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 16 2006

Keywords

Comments

a(n) mod 13 = 0 iff n mod 13 > 0; a(A008595(n)) = 12; a(A113763(n)) = 0.

Crossrefs

Programs

Formula

From Chai Wah Wu, Jun 18 2016: (Start)
a(n) = 13*a(n-1) - 78*a(n-2) + 286*a(n-3) - 715*a(n-4) + 1287*a(n-5) - 1716*a(n-6) + 1716*a(n-7) - 1287*a(n-8) + 715*a(n-9) - 286*a(n-10) + 78*a(n-11) - 13*a(n-12) + a(n-13) for n > 12.
G.f.: x*(4095 + 478205*x + 10187905*x^2 + 66317979*x^3 + 162513078*x^4 + 162511362*x^5 + 66319266*x^6 + 10187190*x^7 + 478491*x^8 + 4017*x^9 + 13*x^10 - x^11)/(1 - x)^13. (End)