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.

A173468 Sum n^k, k=0..n+1.

Original entry on oeis.org

3, 15, 121, 1365, 19531, 335923, 6725601, 153391689, 3922632451, 111111111111, 3452271214393, 116719860413533, 4265491084507563, 167534872139182395, 7037580381120954241, 314824432191309680913, 14942027230321957802947
Offset: 1

Views

Author

Keywords

Comments

1^0+1^1+1^2=3, 2^0+2^1+2^2+2^3=15, 3^0+3^1+3^2+3^3+3^4=121,..

Crossrefs

Programs

  • Maple
    3, seq((n^(n+2)-1)/(n-1),n=2..20); # Robert Israel, Sep 26 2016
  • Mathematica
    f[n_]:=Module[{s=0},Do[s+=n^a,{a,0,n+1}];s]; lst={};Do[AppendTo[lst,f[n]],{n,30}];lst
    Table[Sum[n^k,{k,0,n+1}],{n,20}] (* Harvey P. Dale, Jan 04 2012 *)

Formula

a(n) = (n^(n+2)-1)/(n-1) for n > 1. - Robert Israel, Sep 26 2016