This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268525 a(n) = r*a(ceiling(n/2))+s*a(floor(n/2)) with a(1)=1 and (r,s)=(2,3). 8
 1, 5, 13, 25, 41, 65, 89, 125, 157, 205, 253, 325, 373, 445, 517, 625, 689, 785, 881, 1025, 1121, 1265, 1409, 1625, 1721, 1865, 2009, 2225, 2369, 2585, 2801, 3125, 3253, 3445, 3637, 3925, 4117, 4405, 4693, 5125, 5317, 5605, 5893, 6325, 6613, 7045, 7477, 8125, 8317, 8605, 8893, 9325, 9613, 10045 (list; graph; refs; listen; history; text; internal format)
 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, 2*a(ceil(n/2))+3*a(floor(n/2))); \\ Michel Marcus, Aug 30 2016 (MAGMA) [n le 1 select 1 else 2*Self(Ceiling(n/2))+3*Self(Floor(n/2)): n in [1..60]]; // Vincenzo Librandi, 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: A133322 A299258 A301671 * A146590 A098483 A147205 Adjacent sequences:  A268522 A268523 A268524 * A268526 A268527 A268528 KEYWORD nonn AUTHOR N. J. A. Sloane, Feb 16 2016 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.

Last modified February 20 00:28 EST 2019. Contains 320329 sequences. (Running on oeis4.)