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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184241 Number of strings of numbers x(i=1..3) in 0..n with sum i^2*x(i)^2 equal to n^2*9 1
1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 2, 2, 2, 2, 4, 1, 2, 3, 4, 2, 4, 2, 3, 2, 2, 4, 7, 2, 2, 6, 3, 1, 8, 2, 4, 3, 6, 5, 6, 2, 7, 7, 5, 2, 8, 5, 3, 2, 5, 4, 11, 4, 4, 8, 7, 2, 11, 2, 6, 6, 5, 4, 11, 1, 7, 11, 8, 2, 13, 7, 6, 3, 8, 8, 14, 5, 9, 9, 8, 2, 14, 8, 6, 7, 7, 7, 16, 2, 8, 12, 10, 5, 12, 5, 13, 2, 5, 8, 20, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Row 3 of A184240

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..200

EXAMPLE

All solutions for n=5

..0

..0

..5

CROSSREFS

Sequence in context: A089533 A284312 A261612 * A054390 A161068 A161107

Adjacent sequences:  A184238 A184239 A184240 * A184242 A184243 A184244

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 18:26 EDT 2021. Contains 347473 sequences. (Running on oeis4.)