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!)
 A216642 Number of nondecreasing arrays of n 1..n integers with the sum of their 4th powers equal to sum(i^4,i=1..n) 0
 1, 1, 1, 1, 1, 1, 2, 2, 5, 11, 25, 51, 136, 367, 886, 2507, 6986, 20453, 60708, 172073, 524771, 1628140, 5085497 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 COMMENTS Column 4 of A216645 LINKS EXAMPLE All solutions for n=9 ..3....1....1....1....1 ..3....3....2....1....1 ..4....3....3....2....1 ..5....5....4....2....2 ..6....6....5....4....5 ..7....6....6....5....7 ..7....6....7....6....8 ..8....8....8....9....8 ..8....9....9....9....8 CROSSREFS Sequence in context: A078405 A109278 A112527 * A227999 A049680 A153983 Adjacent sequences:  A216639 A216640 A216641 * A216643 A216644 A216645 KEYWORD nonn AUTHOR R. H. Hardin Sep 11 2012 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 19 00:40 EST 2020. Contains 331030 sequences. (Running on oeis4.)