Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051127
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A051127
%S A051127 0,0,1,0,0,1,0,1,2,1,0,0,0,2,1,0,1,1,3,2,1,0,0,2,0,3,2,1,0,1,0,1,4,3,2,
%T A051127 1,0,0,1,2,0,4,3,2,1,0,1,2,3,1,5,4,3,2,1,0,0,0,0,2,0,5,4,3,2,1,0,1,1,1,
%U A051127 3,1,6,5,4,3,2,1,0,0,2,2,4,2,0,6,5,4,3,2,1,0,1,0,3,0,3,1,7,6,5,4,3,2,1
%N A051127 Table T(n,k) = k mod n read by antidiagonals (n >= 1, k >= 1).
%C A051127 Note that the upper right half of this sequence when formatted as a square 
               array is essentially the same as this whole sequence when formatted 
               as an upper right triangle. Sums of antidiagonals are A004125. - 
               Henry Bottomley (se16(AT)btinternet.com), Jun 22 2001
%C A051127 Row sums are: {0, 1, 1, 4, 3, 8, 8, 12, 13, 22, 17, ...}. - Roger L. 
               Bagula (rlbagulatftn(AT)yahoo.com), Sep 04 2008
%F A051127 t(n,m)=Mod[n - m + 1, m + 1]. - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), 
               Sep 04 2008
%t A051127 Clear[T, n, m]; T[n_, m_] = Mod[n - m + 1, m + 1]; Table[Table[T[n, m], 
               {m, 0, n}], {n, 0, 10}]; Flatten[%] - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), 
               Sep 04 2008
%Y A051127 Transpose of A051126.
%Y A051127 Cf. A048158.
%Y A051127 Cf. A122750.
%Y A051127 Sequence in context: A091006 A167365 A025894 this_sequence A070176 A092606 
               A073253
%Y A051127 Adjacent sequences: A051124 A051125 A051126 this_sequence A051128 A051129 
               A051130
%K A051127 nonn,tabl,easy,nice
%O A051127 1,9
%A A051127 N. J. A. Sloane (njas(AT)research.att.com).
%E A051127 More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 11 1999

    
page 1

Search completed in 0.001 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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research