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.

A083291 Triangular array read by rows: T(n,k) = k*floor(n/10) + n mod 10, 0<=k<=n.

Original entry on oeis.org

0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 3, 4, 5, 6, 7, 8, 9, 10, 11
Offset: 0

Views

Author

Reinhard Zumkeller, Apr 23 2003

Keywords

Comments

A010879(n)=T(n,0);
A076314(0)=T(0,0), A076314(n)=T(n,1) for n>0;
A028897(n)=T(n,n) for n<=1, A028897(n)=T(n,2) for n>1;
A028898(n)=T(n,n) for n<=2, A028898(n)=T(n,3) for n>2;
A028899(n)=T(n,n) for n<=3, A028899(n)=T(n,4) for n>3;
A028900(n)=T(n,n) for n<=4, A028900(n)=T(n,5) for n>4;
A028901(n)=T(n,n) for n<=5, A028901(n)=T(n,6) for n>5;
A028902(n)=T(n,n) for n<=6, A028902(n)=T(n,7) for n>6;
A028903(n)=T(n,n) for n<=7, A028903(n)=T(n,8) for n>7;
A028904(n)=T(n,n) for n<=8, A028904(n)=T(n,9) for n>8;
T(n,n) = n for n<=9, T(n,10) = n for n>9;
A083292(n) = T(n,n).

Examples

			From _Paolo Xausa_, May 22 2024: (Start)
Triangle begins:
   [0] 0;
   [1] 1, 1;
   [2] 2, 2, 2;
   [3] 3, 3, 3, 3;
   [4] 4, 4, 4, 4, 4;
   [5] 5, 5, 5, 5, 5, 5;
   [6] 6, 6, 6, 6, 6, 6, 6;
   [7] 7, 7, 7, 7, 7, 7, 7, 7;
   [8] 8, 8, 8, 8, 8, 8, 8, 8, 8;
   [9] 9, 9, 9, 9, 9, 9, 9, 9, 9, 9;
  [10] 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10;
  ... (End)
		

Programs

  • Mathematica
    Table[k*Floor[n/10] + Mod[n, 10], {n, 0, 10}, {k, 0, n}]//Flatten (* Paolo Xausa, May 22 2024 *)

Extensions

Offset changed to 0 by Paolo Xausa, May 22 2024