This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A106607 #61 Sep 08 2022 12:38:20
%S A106607 1,1,3,5,9,13,20,28,39,51,67,85,107,131,160,192,229,269,315,365,421,
%T A106607 481,548,620,699,783,875,973,1079,1191,1312,1440,1577,1721,1875,2037,
%U A106607 2209,2389,2580,2780,2991,3211,3443,3685,3939,4203,4480,4768,5069,5381,5707,6045
%N A106607 Expansion of (1+t^3)^2/((1-t)*(1-t^2)^2*(1-t^4)).
%C A106607 Molien series for 5-dimensional group of order 8.
%C A106607 For of each of the quadrisections the n-th term is a polynomial in n of degree 3. - _Ralf Stephan_, Nov 16 2010
%C A106607 Number of non-isomorphic 3 X 3 nonnegative integer matrices with all row and column sums equal to n up to permutations of rows and columns. - _Andrew Howroyd_, Apr 08 2020
%C A106607 Take the square spiral on the square grid, with cells on the spiral numbered starting at 1. Every time the spiral crosses the x- or y-axis, calculate the sum of the numbers on the intersection of the spiral and the axis. This produces the present sequence (see illustration). - _Karl-Heinz Hofmann_, Aug 14 2022
%H A106607 G. C. Greubel, <a href="/A106607/b106607.txt">Table of n, a(n) for n = 0..1000</a>
%H A106607 S. Ling and P. Solé, <a href="https://doi.org/10.1006/eujc.2001.0509">Type II Codes over F_4 + u F_4</a>, European J. Combinatorics, 22 (2001), pp. 983-997.
%H A106607 Karl-Heinz Hofmann, <a href="/A106607/a106607_1.pdf">An alternative way to get the terms of A106607. Examples of a(1..18)</a>
%H A106607 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1,1,-3,3,-1).
%F A106607 G.f.: (1-x+x^2)^2/( (1+x)*(1+x^2)*(1-x)^4 ). - _R. J. Mathar_, Dec 18 2014
%F A106607 a(n) = (4*n^3 +18*n^2 +56*n +3*(9*(-1)^n +2*(1-i)*(-i)^n +2*(1+i)*i^n +19))/96 where i is the imaginary unit. - _Colin Barker_, Feb 08 2016
%F A106607 E.g.f.: (1/48)*(6*(cos(x) - sin(x)) + p(x)*sinh(x) + (27 + p(x))*cosh(x)), where p(x) = 15 + 39*x + 15*x^2 + 2*x^3. - _G. C. Greubel_, Sep 08 2021
%e A106607 The a(4) = 9 symmetric matrices are:
%e A106607 [0 0 4] [0 1 3] [0 1 3] [0 2 2] [0 2 2]
%e A106607 [0 4 0] [1 2 1] [1 3 0] [2 0 2] [2 1 1]
%e A106607 [4 0 0] [3 1 0] [3 0 1] [2 2 0] [2 1 1]
%e A106607 .
%e A106607 [1 1 2] [1 0 3] [1 1 2] [2 0 2]
%e A106607 [1 2 1] [0 4 0] [1 3 0] [0 4 0]
%e A106607 [2 1 1] [3 0 1] [2 0 2] [2 0 2]
%p A106607 (1+t^3)^2/((1-t)*(1-t^2)^2*(1-t^4));
%p A106607 seq(coeff(series(%,t,n+1), t,n), n=0..60);
%t A106607 LinearRecurrence[{3,-3,1,1,-3,3,-1}, {1,1,3,5,9,13,20}, 61] (* _G. C. Greubel_, Sep 08 2021 *)
%o A106607 (PARI) a(n) = i=I; (4*n^3+18*n^2+56*n+3*(9*(-1)^n+(2-2*i)*(-i)^n+(2+2*i)*i^n+19))/96 \\ _Colin Barker_, Feb 08 2016
%o A106607 (Sage)
%o A106607 def A106607_list(prec):
%o A106607 P.<x> = PowerSeriesRing(ZZ, prec)
%o A106607 return P( (1+x^3)^2/((1-x)*(1-x^2)^2*(1-x^4)) ).list()
%o A106607 A106607_list(60) # _G. C. Greubel_, Sep 08 2021
%Y A106607 Row n=3 of A333737.
%Y A106607 Cf. A100779.
%K A106607 nonn,easy
%O A106607 0,3
%A A106607 _N. J. A. Sloane_, May 12 2005