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

Number of nondecreasing arrangements of n+2 numbers in 0..3 with the last equal to 3 and each after the second equal to the sum of one or two of the preceding four
1

%I #5 Mar 31 2012 12:36:15

%S 5,7,11,16,22,28,34,40,46,52,58,64,70,76,82,88,94,100,106,112,118,124,

%T 130,136,142,148,154,160,166,172,178,184,190,196,202,208,214,220,226,

%U 232,238,244,250,256,262,268,274,280,286,292,298,304,310,316,322,328,334,340

%N Number of nondecreasing arrangements of n+2 numbers in 0..3 with the last equal to 3 and each after the second equal to the sum of one or two of the preceding four

%C Column 3 of A189326

%H R. H. Hardin, <a href="/A189320/b189320.txt">Table of n, a(n) for n = 1..200</a>

%F Empirical: a(n) = 6*n - 8 for n>3

%e All solutions for n=4

%e ..2....1....1....1....0....0....3....1....0....1....1....1....0....1....1....1

%e ..3....2....2....1....1....1....3....3....1....1....1....2....3....1....1....1

%e ..3....2....2....2....1....1....3....3....1....1....1....3....3....1....2....2

%e ..3....3....2....2....2....2....3....3....1....2....2....3....3....1....2....3

%e ..3....3....3....3....2....3....3....3....2....2....3....3....3....2....2....3

%e ..3....3....3....3....3....3....3....3....3....3....3....3....3....3....3....3

%K nonn

%O 1,1

%A _R. H. Hardin_ Apr 20 2011