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.

A116554 a(2*n+1) = 7*a(n), a(2*n+2) = 8*a(n) + a(n-1).

This page as a plain text file.
%I A116554 #22 Aug 02 2025 06:30:07
%S A116554 1,7,8,49,57,56,71,343,400,399,505,392,505,497,624,2401,2815,2800,
%T A116554 3543,2793,3592,3535,4439,2744,3641,3535,4432,3479,4481,4368,5489,
%U A116554 16807,19832,19705,24921,19600,25215,24801,31144,19551,25887,25144,31529
%N A116554 a(2*n+1) = 7*a(n), a(2*n+2) = 8*a(n) + a(n-1).
%H A116554 G. C. Greubel, <a href="/A116554/b116554.txt">Table of n, a(n) for n = 0..2500</a>
%F A116554 From _G. C. Greubel_, Oct 30 2016: (Start)
%F A116554 a(2*n+1) = 7*a(n).
%F A116554 a(2*n+2) = 8*a(n) + a(n-1). (End)
%t A116554 b[0] := 0; b[1] := 1;
%t A116554 b[n_?EvenQ] := b[n] = 7*b[n/2];
%t A116554 b[n_?OddQ] := b[n] = 8*b[(n - 1)/2] + b[(n - 3)/2];
%t A116554 Table[b[n], {n, 1, 70}]
%Y A116554 Cf. A116528, A116529, A116552, A116553, A116555.
%K A116554 nonn,easy
%O A116554 0,2
%A A116554 _Roger L. Bagula_, Mar 15 2006
%E A116554 Edited by _N. J. A. Sloane_, Feb 11 2007
%E A116554 New name using formula, _Joerg Arndt_, Dec 17 2022