|
| |
|
|
A184435
|
|
Number of strings of numbers x(i=1..n) in 0..3 with sum i*x(i)^2 equal to n*9
|
|
1
|
|
|
|
1, 1, 2, 5, 19, 51, 130, 359, 946, 2333, 5818, 14088, 33135, 76611, 173464, 384457, 837012, 1790715, 3766901, 7802712, 15923697, 32039816, 63611885, 124689752, 241431996, 462031599, 874300348, 1636607223, 3031814449, 5560277156
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
COMMENTS
|
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
Some solutions for n=5
..0....1....3....2....2....3....0....1....2....3....3....1....2....2....1....0
..0....0....0....1....1....0....3....2....0....0....0....2....2....3....2....1
..0....1....0....1....1....0....1....3....0....2....3....0....2....1....0....3
..0....3....2....2....3....3....1....1....3....1....1....3....2....0....2....2
..3....1....2....2....0....0....2....1....1....2....1....0....1....2....2....0
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
