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.

A024020 a(n) = 2^n - n^10.

Original entry on oeis.org

1, 1, -1020, -59041, -1048560, -9765593, -60466112, -282475121, -1073741568, -3486783889, -9999998976, -25937422553, -61917360128, -137858483657, -289254638592, -576650357857, -1099511562240, -2015993769377
Offset: 0

Views

Author

Keywords

Programs

Formula

From Chai Wah Wu, Jan 26 2020: (Start)
a(n) = 13*a(n-1) - 77*a(n-2) + 275*a(n-3) - 660*a(n-4) + 1122*a(n-5) - 1386*a(n-6) + 1254*a(n-7) - 825*a(n-8) + 385*a(n-9) - 121*a(n-10) + 23*a(n-11) - 2*a(n-12) for n > 11.
G.f.: (x^11 + 2036*x^10 + 94612*x^9 + 862709*x^8 + 2165186*x^7 + 1310816*x^6 - 400432*x^5 - 359182*x^4 - 45979*x^3 - 956*x^2 - 12*x + 1)/((x - 1)^11*(2*x - 1)). (End)