login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184442 Number of strings of numbers x(i=1..3) in 0..n with sum i*x(i)^2 equal to n*9 1
2, 3, 2, 3, 5, 5, 5, 3, 5, 10, 5, 5, 8, 12, 6, 3, 7, 10, 7, 10, 12, 13, 9, 5, 16, 18, 11, 12, 11, 21, 14, 3, 9, 16, 23, 10, 16, 18, 18, 10, 16, 30, 14, 13, 22, 26, 14, 5, 22, 39, 15, 18, 22, 26, 26, 12, 20, 29, 19, 21, 21, 37, 27, 3, 35, 30, 22, 16, 29, 61, 23, 10, 25, 45, 34, 18, 30, 48, 25 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Row 3 of A184441
LINKS
EXAMPLE
All solutions for n=5
..3....0....5....4....5
..3....0....1....4....5
..4....5....4....3....0
CROSSREFS
Sequence in context: A151570 A341520 A059036 * A295609 A163466 A306733
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 14 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 26 00:14 EDT 2024. Contains 374615 sequences. (Running on oeis4.)