The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068906 Square array read by antidiagonals of partitions of k modulo n. 3
 0, 0, 1, 0, 0, 1, 0, 1, 2, 1, 0, 1, 0, 2, 1, 0, 1, 2, 3, 2, 1, 0, 1, 1, 1, 3, 2, 1, 0, 1, 2, 3, 0, 3, 2, 1, 0, 0, 0, 3, 2, 5, 3, 2, 1, 0, 0, 1, 3, 1, 1, 5, 3, 2, 1, 0, 0, 0, 2, 0, 5, 0, 5, 3, 2, 1, 0, 0, 0, 2, 2, 3, 4, 7, 5, 3, 2, 1, 0, 1, 2, 2, 0, 4, 1, 3, 7, 5, 3, 2, 1, 0, 1, 2, 0, 2, 0, 1, 7, 2, 7, 5, 3, 2, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS 0 is disproportionately common modulo 5, 7 and 11, largely because T(5,5m+4)=T(7,7m+5)=T(11,11m+6)=0. LINKS Henry Bottomley, Partition calculators using java applets FORMULA T(n, k) =A051127(n, A000041(k)) EXAMPLE Rows start 0,0,0,0,0,...; 1,0,1,1,1,...; 1,2,0,2,1,...; 1,2,3,1,3,...; 1,2,3,0,2,1,...; 1,2,3,5,1,5,...; 1,2,3,5,0,...; 1,2,3,5,7,...; etc. CROSSREFS Rows 2, 3, 5, 7 and 11 give A040051, A068907, A068908, A068909, A020919. Sequence in context: A130161 A115672 A079694 * A162514 A166347 A055300 Adjacent sequences:  A068903 A068904 A068905 * A068907 A068908 A068909 KEYWORD nonn,tabl AUTHOR Henry Bottomley, Mar 05 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 20 19:53 EST 2020. Contains 331096 sequences. (Running on oeis4.)