login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022324 a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 10. 1
1, 10, 12, 23, 36, 60, 97, 158, 256, 415, 672, 1088, 1761, 2850, 4612, 7463, 12076, 19540, 31617, 51158, 82776, 133935, 216712, 350648, 567361, 918010, 1485372, 2403383, 3888756, 6292140, 10180897 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
From R. J. Mathar, Apr 07 2011: (Start)
G.f.: (1+8*x-8*x^2)/((1-x)*(1-x-x^2)).
a(n) = A022115(n) - 1. (End)
a(n) = 2*F(n+2) + 7*F(n) - 1, where F = A000045. - G. C. Greubel, Aug 25 2017
MATHEMATICA
LinearRecurrence[{2, 0, -1}, {1, 10, 12}, 50] (* G. C. Greubel, Aug 25 2017 *)
RecurrenceTable[{a[0]==1, a[1]==10, a[n]==a[n-1]+a[n-2]+1}, a, {n, 30}] (* Harvey P. Dale, Nov 04 2019 *)
PROG
(PARI) x='x+O('x^50); vec((1+8*x-8*x^2)/((1-x)*(1-x-x^2))) \\ G. C. Greubel, Aug 25 2017
CROSSREFS
Sequence in context: A120001 A108703 A098785 * A084953 A235686 A087697
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 2 05:08 EST 2024. Contains 370460 sequences. (Running on oeis4.)