login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A216640
Number of nondecreasing arrays of n 1..n integers with the sum of their 2nd powers equal to sum(i^2,i=1..n)
1
1, 1, 1, 1, 1, 3, 8, 25, 83, 257, 788, 2491, 7885, 25099, 80481, 264505, 884517, 2994535, 10208806, 35095825, 121699761, 424273761, 1487693075, 5244197347, 18584820912, 66169376686, 236592018517, 849466213882, 3061492852986, 11072927827447
OFFSET
1,6
COMMENTS
Column 2 of A216645
LINKS
EXAMPLE
All solutions for n=6
..1....3....1
..2....3....1
..3....4....1
..4....4....4
..5....4....6
..6....5....6
CROSSREFS
Sequence in context: A161634 A293385 A258466 * A148794 A143330 A148795
KEYWORD
nonn
AUTHOR
R. H. Hardin Sep 11 2012
STATUS
approved