(Translated by https://www.hiragana.jp/)
# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a183910 Showing 1-1 of 1 %I A183910 #9 Apr 06 2018 10:07:39 %S A183910 2,5,40,207,778,2199,5126,10501,19630,34274,56754,90071,138042,205453, %T A183910 298230,423629,590446,809248,1092626,1455471,1915274,2492451,3210694, %U A183910 4097349,5183822,6506014,8104786,10026455,12323322,15054233,18285174 %N A183910 Number of nondecreasing arrangements of n+2 numbers in 0..7 with each number being the sum mod 8 of two others. %C A183910 Column 7 of A183912. %H A183910 R. H. Hardin, Table of n, a(n) for n = 1..61 %F A183910 Empirical: a(n) = (1/5040)*n^7 + (1/120)*n^6 + (53/360)*n^5 + (17/12)*n^4 - (1313/720)*n^3 - (1777/40)*n^2 + (14876/105)*n - 83 for n>3. %F A183910 Conjectures from _Colin Barker_, Apr 06 2018: (Start) %F A183910 G.f.: x*(2 - 11*x + 56*x^2 - 85*x^3 + 102*x^4 - 231*x^5 + 302*x^6 - 129*x^7 - 44*x^8 + 49*x^9 - 10*x^10) / (1 - x)^8. %F A183910 a(n) = 8*a(n-1) - 28*a(n-2) + 56*a(n-3) - 70*a(n-4) + 56*a(n-5) - 28*a(n-6) + 8*a(n-7) - a(n-8) for n>10. %F A183910 (End) %e A183910 All solutions for n=2: %e A183910 ..0....2....2....0....0 %e A183910 ..0....2....4....0....4 %e A183910 ..0....4....6....4....4 %e A183910 ..0....6....6....4....4 %Y A183910 Cf. A183912. %K A183910 nonn %O A183910 1,1 %A A183910 _R. H. Hardin_, Jan 07 2011 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE