login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323261 A323260(n)/2. 2
0, 1, 3, 12, 48, 195, 791, 3211, 13031, 52884, 214614, 870949, 3534489, 14343685, 58209627, 236226664, 958656488, 3890425619, 15788149015, 64071562799, 260015607607, 1055196927408, 4282206617710, 17378077058869, 70523818494625, 286200191092217, 1161459364079427, 4713441487441732, 19128117041912800 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Colin Barker, Table of n, a(n) for n = 0..1000

K. A. Van'kov, V. M. Zhuravlyov, Regular tilings and generating functions, Mat. Pros. Ser. 3, issue 22, 2018 (127-157) [in Russian]. See Table 1, g_n/2.

Index entries for linear recurrences with constant coefficients, signature (5,-3,-5,7,-1).

FORMULA

Van'kov and Zhuravlyov give recurrences.

From Colin Barker, Jan 10 2019: (Start)

G.f.: x*(1 - x)^3*(1 + x) / (1 - 5*x + 3*x^2 + 5*x^3 - 7*x^4 + x^5).

a(n) = 5*a(n-1) - 3*a(n-2) - 5*a(n-3) + 7*a(n-4) - a(n-5) for n>5.

(End)

PROG

(PARI) concat(0, Vec(x*(1 - x)^3*(1 + x) / (1 - 5*x + 3*x^2 + 5*x^3 - 7*x^4 + x^5) + O(x^30))) \\ Colin Barker, Jan 10 2019

CROSSREFS

Cf. A323260.

Sequence in context: A164346 A002001 A113956 * A103943 A283679 A165328

Adjacent sequences:  A323258 A323259 A323260 * A323262 A323263 A323264

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Jan 09 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 07:53 EDT 2019. Contains 324347 sequences. (Running on oeis4.)