Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083291
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083291 Triangular array read by rows: T(n,k) = k*floor(n/10) + n mod 10, 0<=k<=n. +0
2
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 (list; table; graph; listen)
OFFSET

1,4

COMMENT

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).

CROSSREFS

Sequence in context: A108229 A023966 A088141 this_sequence A003056 A117707 A163352

Adjacent sequences: A083288 A083289 A083290 this_sequence A083292 A083293 A083294

KEYWORD

nonn,tabl

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 23 2003

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 18 09:28 EDT 2010. Contains 173524 sequences.


AT&T Labs Research