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.
a(n)=n^(2*n-2) \\ Charles R Greathouse IV, Mar 31 2016
G.f.: A(x) = 1 + x + x^3 + 46*x^4 + 1723*x^5 + 81104*x^6 + 4793304*x^7 +... The coefficients in A(x)^(n^2) begin: n=1: [1, 1, 0, 1, 46, 1723, 81104, 4793304, 349869074, ...]; n=2: [1, 4, 6, 8, 197, 7456, 345654, 20167888, 1458010566, ...]; n=3: [1, 9, 36, 93, 612, 19197, 866208, 49440834, 3515499819, ...]; n=4: [1, 16, 120, 576, 2796, 44656, 1803872, 99433344, ...]; n=5: [1, 25, 300, 2325, 14400, 130705, 3606800, 183492150, ...]; n=6: [1, 36, 630, 7176, 61821, 518400, 8260086, 332807184, ...]; n=7: [1, 49, 1176, 18473, 216482, 2154775, 25401600, 655445812, ...]; n=8: [1, 64, 2016, 41728, 642352, 8045248, 95405312, 1625702400, ...]; n=9: [1, 81, 3240, 85401, 1673946, 26315199, 360707040, 5266837404, 131681894400, ...]; ... where the terms along the main diagonal begin: [1, 4, 36, 576, 14400, 518400, 25401600, 1625702400, ..., (n!)^2, ...]. LOCATION OF ODD TERMS. Note that odd terms a(n) occur at positions n starting with: [0, 1, 3, 5, 9, 11, 17, 19, 21, 33, 35, 37, 41, 43, 65, 67, 69, 73, 75, 81, 83, 85, 129, 131, 133, 137, 139, 145, 147, 149, 161, 163, 165, 169, 171, 257, ...], which seems to equal A118113, the even fibbinary numbers + 1, with an initial zero included.
{a(n) = local(A=[1, 1]); for(i=1, n+1, A=concat(A, 0); m=#A; A[m] = ( m!^2 - Vec(Ser(A)^(m^2))[m] )/m^2 ); A[n+1]}
for(n=0, 20, print1(a(n), ", "))
Comments