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.

A116552 a(2*n+1) = 3*a(n), a(2*n+2) = 4*a(n) + a(n-1).

This page as a plain text file.
%I A116552 #14 Dec 17 2022 06:57:02
%S A116552 1,3,4,9,13,12,19,27,40,39,61,36,61,57,88,81,127,120,187,117,196,183,
%T A116552 283,108,205,183,280,171,289,264,409,243,412,381,589,360,607,561,868,
%U A116552 351,655,588,901,549,928,849,1315,324,715,615,928,549,937,840,1303,513
%N A116552 a(2*n+1) = 3*a(n), a(2*n+2) = 4*a(n) + a(n-1).
%H A116552 G. C. Greubel, <a href="/A116552/b116552.txt">Table of n, a(n) for n = 0..2500</a>
%F A116552 From _G. C. Greubel_, Oct 30 2016: (Start)
%F A116552 a(2*n+1) = 3*a(n).
%F A116552 a(2*n+2) = 4*a(n) + a(n-1). (End)
%t A116552 b[0] := 0; b[1] := 1;
%t A116552 b[n_?EvenQ] := b[n] = 3*b[n/2];
%t A116552 b[n_?OddQ] := b[n] = 4*b[(n - 1)/2] + b[(n - 3)/2];
%t A116552 Table[b[n], {n, 1, 70}]
%Y A116552 Cf. A116528, A116529, A116553, A116554, A116555.
%K A116552 nonn,easy
%O A116552 0,2
%A A116552 _Roger L. Bagula_, Mar 15 2006
%E A116552 New name using formula, _Joerg Arndt_, Dec 17 2022