cp's OEIS Frontend

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.

A272398 The union of hexagonal numbers (A000384) and centered 9-gonal numbers (A060544).

This page as a plain text file.
%I A272398 #13 Jul 16 2016 07:32:00
%S A272398 1,6,10,15,28,45,55,66,91,120,136,153,190,231,253,276,325,378,406,435,
%T A272398 496,561,595,630,703,780,820,861,946,1035,1081,1128,1225,1326,1378,
%U A272398 1431,1540,1653,1711,1770,1891,2016,2080,2145,2278,2415,2485,2556,2701,2850
%N A272398 The union of hexagonal numbers (A000384) and centered 9-gonal numbers (A060544).
%C A272398 The construction of the g.f. works basically as follows every third entry of A000384 equals every second entry of A060544, A000384(3n+1) = A060544(2n+1) = (3*n+1)*(6*n+1), which is an immediate consequence of their polynomial representations. So the sequence is the union of A000384 and the bisection 10, 55, 136, 253,... of A060544. Following Section 4.3 of Riordan's book "Combinatorial identities", subsampling and "aering" are done by replacing the independent variable of the g.f. by roots of the independent variable. So this sequence has rational g.f. because it is derived by regular interlacing of the two original sequences which also have rational g.f.'s. - _R. J. Mathar_, Jul 15 2016
%H A272398 Colin Barker, <a href="/A272398/b272398.txt">Table of n, a(n) for n = 1..1000</a>
%F A272398 a(4*n-3) = A272399(n).
%F A272398 Conjectures:
%F A272398   a(n) = (-1+(-1)^n-6*((-i)^n+i^n)*n+18*n^2)/16 where i is the imaginary unit.
%F A272398   a(n) = 2*a(n-1)-2*a(n-2)+2*a(n-3)-2*a(n-5)+2*a(n-6)-2*a(n-7)+a(n-8) for n>8.
%F A272398   G.f.: x*(1+4*x+5*x^3+6*x^4+x^5+x^6) / ((1-x)^3*(1+x)*(1+x^2)^2).
%Y A272398 Cf. A000384, A060544, A272399 (intersection).
%K A272398 nonn
%O A272398 1,2
%A A272398 _Colin Barker_, Apr 28 2016