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.

A038125 a(n) = Sum_{k=0..n} (k-n)^k.

Original entry on oeis.org

1, 1, 0, 0, 1, -1, 0, 6, -19, 29, 48, -524, 2057, -3901, -9632, 129034, -664363, 1837905, 2388688, -67004696, 478198545, -1994889945, 1669470784, 56929813934, -615188040195, 3794477505573, -12028579019536, -50780206473220
Offset: 0

Views

Author

Jim Ferry (jferry(AT)alum.mit.edu)

Keywords

Examples

			0^0 = 1,
1^0 - 0^1 = 1,
2^0 - 1^1 + 0^2 = 0,
3^0 - 2^1 + 1^2 - 0^3 = 0,
...
		

Crossrefs

Programs

  • Mathematica
    Prepend[ Table[ Sum[ (k-n)^k, {k, 0, n} ], {n, 30} ], 1 ]
  • PARI
    my(N=40, x='x+O('x^N)); Vec(sum(k=0, N, x^k/(1+k*x))) \\ Seiichi Manyama, Dec 02 2021
    
  • PARI
    a(n) = sum(k=0, n, (k-n)^k); \\ Michel Marcus, Dec 03 2021

Formula

G.f.: 1+ sum(k>=0, x^(k+1)/(1+x^(k+1)) ) = 1/Q(0), where Q(k) = 1 - x + x^2*(k+1)/(1 + (k+1)*x/Q(k+1) ); (continued fraction). - Sergei N. Gladkovskii, Jan 10 2014