login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A268527
a(n) = r*a(ceiling(n/2))+s*a(floor(n/2)) with a(1)=1 and (r,s)=(4,1).
8
1, 5, 21, 25, 89, 105, 121, 125, 381, 445, 509, 525, 589, 605, 621, 625, 1649, 1905, 2161, 2225, 2481, 2545, 2609, 2625, 2881, 2945, 3009, 3025, 3089, 3105, 3121, 3125, 7221, 8245, 9269, 9525, 10549, 10805, 11061, 11125, 12149, 12405, 12661, 12725, 12981, 13045, 13109, 13125, 14149, 14405
OFFSET
1,2
LINKS
K.-N. Chang and S.-C. Tsai, Exact solution of a minimal recurrence, Inform. Process. Lett. 75 (2000), 61-64.
PROG
(PARI) a(n) = if (n==1, 1, 4*a(ceil(n/2))+a(floor(n/2))); \\ Michel Marcus, Aug 30 2016
CROSSREFS
Sequences of form a(n) = r*a(ceiling(n/2))+s*a(floor(n/2)) with a(1)=1 and (r,s) = (1,1), (1,2), (2,1), (1,3), (2,2), (3,1), (1,4), (2,3), (3,2), (4,1): A000027, A006046, A064194, A130665, A073121, A268524, A116520, A268525, A268526, A268527.
Sequence in context: A099654 A195959 A228141 * A176300 A042319 A302305
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Feb 16 2016
STATUS
approved