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.

Showing 1-2 of 2 results.

A048472 Array T by antidiagonals, T(k,n)=(k+1)*n*2^(n-1)+1, n >= 0, k >= 1.

Original entry on oeis.org

1, 2, 1, 5, 3, 1, 13, 9, 4, 1, 33, 25, 13, 5, 1, 81, 65, 37, 17, 6, 1, 193, 161, 97, 49, 21, 7, 1, 449, 385, 241, 129, 61, 25, 8, 1, 1025, 897, 577, 321, 161, 73, 29, 9, 1, 2305, 2049, 1345, 769, 401, 193, 85, 33, 10, 1, 5121, 4609, 3073
Offset: 0

Views

Author

Keywords

Comments

n-th difference of (T(k,n),T(k,n-1),...,T(k,0)) is (k+1)n, for n=1,2,3,...; k=0,1,2,...

Examples

			Antidiagonals: {1}; {2,1}; {5,3,1}; ...
		

Crossrefs

See A049069 for transposed array.
Row 1 = (1, 2, 5, 13, 33, ...) = A005183.
Row 2 = (1, 3, 9, 25, 65, ...) = A002064.

Programs

  • PARI
    T(n,k)=if(n<0 || k<1,0,k*n*2^(n-1)+1)

Extensions

Better description from Michael Somos

A049513 Array T by antidiagonals: T(k,n) = k*n*2^(n-1) + 1, n >= 0, k >= 0.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 5, 1, 1, 4, 9, 13, 1, 1, 5, 13, 25, 33, 1, 1, 6, 17, 37, 65, 81, 1, 1, 7, 21, 49, 97, 161, 193, 1, 1, 8, 25, 61, 129, 241, 385, 449, 1, 1, 9, 29, 73, 161, 321, 577, 897, 1025, 1, 1, 10, 33, 85, 193, 401, 769, 1345, 2049, 2305, 1, 1, 11, 37, 97, 225, 481
Offset: 0

Views

Author

Michael Somos, Sep 25 1999

Keywords

Examples

			Antidiagonals: 1; 1,1; 1,2,1; 1,3,5,1; 1,4,9,13,1; ...
		

Crossrefs

Essentially the same as A049069.

Programs

  • PARI
    {T(k, n) = k * n * 2^(n-1) + 1}

Formula

A005183(n) = T(1, n), A002064(n) = T(2, n), A048474(n) = T(3, n), A000337(n) = T(4, n), A016813(n) = T(n, 2), A017533(n) = T(n, 3).
Showing 1-2 of 2 results.