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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A184305 Number of strings of numbers x(i=1..4) in 0..n with sum i^3*x(i)^2 equal to 64*n^2 1
 1, 1, 1, 2, 2, 1, 1, 3, 1, 2, 1, 3, 3, 3, 3, 4, 5, 2, 1, 7, 4, 1, 3, 5, 5, 5, 2, 7, 6, 10, 5, 10, 10, 9, 9, 10, 11, 10, 9, 17, 12, 13, 10, 13, 14, 18, 10, 17, 11, 21, 17, 21, 16, 14, 14, 20, 19, 20, 21, 36, 20, 21, 20, 30, 30, 27, 22, 35, 31, 34, 30, 28, 32, 35, 34, 37, 27, 36, 30, 55, 35, 39 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Row 4 of A184303 LINKS R. H. Hardin, Table of n, a(n) for n = 1..200 EXAMPLE All solutions for n=5 ..4....0 ..4....0 ..4....0 ..4....5 CROSSREFS Sequence in context: A318810 A319989 A338117 * A337279 A157522 A059674 Adjacent sequences:  A184302 A184303 A184304 * A184306 A184307 A184308 KEYWORD nonn AUTHOR R. H. Hardin Jan 10 2011 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 November 30 09:34 EST 2021. Contains 349419 sequences. (Running on oeis4.)