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.

A315907 Coordination sequence Gal.3.40.3 where Gal.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.

This page as a plain text file.
%I A315907 #11 Jan 16 2024 15:54:57
%S A315907 1,6,8,14,20,22,28,34,36,42,48,50,56,62,64,70,76,78,84,90,92,98,104,
%T A315907 106,112,118,120,126,132,134,140,146,148,154,160,162,168,174,176,182,
%U A315907 188,190,196,202,204,210,216,218,224,230
%N A315907 Coordination sequence Gal.3.40.3 where Gal.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
%C A315907 Note that there may be other vertices in the Galebach list of u-uniform tilings with u <= 6 that have this same coordination sequence. See the Galebach link for the complete list of A-numbers for all these tilings.
%H A315907 Brian Galebach, <a href="/A250120/a250120.html">k-uniform tilings (k <= 6) and their A-numbers</a>.
%F A315907 Conjectures from _R. J. Mathar_, May 02 2023: (Start)
%F A315907 G.f.: 1 + 2*x*(3+x+3*x^2)  / ( (1+x+x^2)*(x-1)^2 ).
%F A315907 a(n) = a(n-1) + a(n-3) - a(n-4) for n > 4.
%F A315907 a(n) = 2*A047342(n+1) for n > 0. (End)
%Y A315907 Cf. A047342.
%K A315907 nonn
%O A315907 0,2
%A A315907 _Brian Galebach_ and _N. J. A. Sloane_, Jun 18 2018