[go: up one dir, main page]

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”).

A135688
a(n) = A004001(n)*a(n-1) + a(n-2), for n > 2, with a(1) = a(2) = 1.
2
1, 1, 3, 7, 24, 103, 436, 1847, 9671, 59873, 428782, 3061347, 24919558, 202417811, 1644262046, 13356514179, 121852889657, 1231885410749, 13672592407896, 165302994305501, 1997308524073908, 26130313807266305, 367821701825802178
OFFSET
1,3
LINKS
FORMULA
a(n) = A004001(n)*a(n-1) + a(n-2), for n > 2, with a(1) = a(2) = 1.
MATHEMATICA
HC[n_]:= HC[n]= If[n<3, Fibonacci[n], HC[HC[n-1]] +HC[n -HC[n-1]]]; (*A004001*)
a[n_] := a[n] = If[n<3, 1, HC[n]*a[n-1] + a[n-2]];
Table[a[n], {n, 40}]
PROG
(Sage)
@cached_function
def HC(n): # HC = A004001
if (n<3): return fibonacci(n)
else: return HC(HC(n-1)) +HC(n -HC(n-1))
@CachedFunction
def a(n): # A135688
if (n<3): return 1
else: return HC(n)*a(n-1) + a(n-2)
[a(n) for n in (1..40)] # G. C. Greubel, Nov 25 2021
CROSSREFS
Sequence in context: A176606 A007172 A027610 * A252785 A229039 A005642
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Feb 19 2008
EXTENSIONS
Edited and corrected by Eric M. Schmidt, Dec 21 2014
STATUS
approved