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.

A091453 Triangular array T(n,k) read by rows in which row n consists of the numbers floor(2n/k), k=1,2,...,2n+1.

Original entry on oeis.org

0, 0, 2, 1, 0, 4, 2, 1, 1, 0, 6, 3, 2, 1, 1, 1, 0, 8, 4, 2, 2, 1, 1, 1, 1, 0, 10, 5, 3, 2, 2, 1, 1, 1, 1, 1, 0, 12, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 0, 14, 7, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 0, 16, 8, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 18, 9, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 20, 10, 6
Offset: 0

Views

Author

Clark Kimberling, Feb 03 2004

Keywords

Examples

			First five rows:
  0
  0 2 1
  0 4 2 1 1
  0 6 3 2 1 1 1
  0 8 4 2 2 1 1 1 1
		

Crossrefs

Cf. A013942 (without first column).

Programs

  • PARI
    T(n, k) = 2*n\k;
    tabf(nn) = for (n=0, nn, for (k=1, 2*n+1, print1(T(n,k), ", ")); print()); \\ Michel Marcus, Sep 30 2016
    
  • PARI
    a(n)={if(n<1, 0, my(t=sqrtint(n-1)); 2*t\(n-t^2))} \\ Andrew Howroyd, Oct 02 2019

Formula

a(n) = floor(1/(sqrt(n)-floor(sqrt(n)))) for n not a square; a(n) = 0 otherwise. - Andrew Howroyd, Oct 02 2019

Extensions

Offset corrected and missing a(99) inserted by Andrew Howroyd, Oct 02 2019