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.

A100454 a(n) = sum of n-th column in array in A100452.

Original entry on oeis.org

1, 7, 24, 58, 109, 188, 307, 444, 641, 885, 1149, 1493, 1936, 2358, 2975, 3645, 4267, 5102, 6057, 6941, 8124, 9395, 10458, 12140, 13561, 15336, 17110, 19204, 21124, 23596, 26219, 28587, 31254, 34593, 37252, 40545, 44524, 47451, 51724, 55853, 60068, 64152, 69801, 73657, 79372
Offset: 1

Views

Author

N. J. A. Sloane, Nov 22 2004

Keywords

Crossrefs

Cf. A100452.

Programs

  • Magma
    function t(n, k) // t = A100452
      if k eq 1 then return n^2;
      else return (n-k+1)*Floor((t(n, k-1) -1)/(n-k+1));
      end if;
    end function;
    A100454:= func< n | (&+[t(n,n-k+1): k in [1..n]]) >;
    [A100454(n): n in [1..60]]; // G. C. Greubel, Apr 07 2023
    
  • Mathematica
    t[1, n_]:= n^2;  (* t = A100452 *)
    t[m_, n_]/; 1, ]=0;
    A100454[n_]:= A100454[n]= Sum[t[n-k+1,n], {k,n}];
    Table[A100454[n], {n, 60}] (* G. C. Greubel, Apr 07 2023 *)
  • SageMath
    def t(n, k): # t = A100452
        if (k==1): return n^2
        else: return (n-k+1)*((t(n, k-1) -1)//(n-k+1))
    def A100454(n): return sum(t(n,n-k+1) for k in range(1,n+1))
    [A100454(n) for n in range(1,61)] # G. C. Greubel, Apr 07 2023

Extensions

Terms a(26) onward added by G. C. Greubel, Apr 07 2023