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”).

A184234
Number of strings of numbers x(i=1..n) in 0..3 with sum i^2*x(i)^2 equal to n^2*9
1
1, 1, 2, 1, 5, 5, 41, 36, 199, 420, 1377, 4140, 10728, 36839, 87400, 283225, 660812, 1940633, 4609045, 12276261, 29878104, 73822900, 181872899, 428160287, 1053371836, 2416581766, 5864707345, 13309989382, 31614183273, 71451195226
OFFSET
1,3
COMMENTS
Column 3 of A184240
LINKS
EXAMPLE
All solutions for n=5
..3....0....2....0....3
..3....0....2....0....2
..2....0....2....3....2
..3....0....3....3....2
..0....3....1....0....2
CROSSREFS
Sequence in context: A317878 A209108 A269019 * A193816 A335136 A193722
KEYWORD
nonn
AUTHOR
R. H. Hardin Jan 10 2011
STATUS
approved