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!)
A195308 a(n) = A005291(n) + A005291(n+1). 0
1, 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 43, 58, 81, 109, 150, 200, 271, 359, 481, 633, 838, 1095, 1438, 1867, 2430, 3136, 4053, 5200, 6676, 8519 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
This sequence arises from A005291 in the same way as A000041 arises from A182712.
Observation: a(3)..a(13) coincide with a sequence related to Stirling's numbers from the Jordan's book.
REFERENCES
C. Jordan, Calculus of finite differences, Chelsea Publishing Co. (1965), chapter IV, 153-155.
LINKS
FORMULA
a(n) = A000041(n-2), 2 <= n <= 11. - Omar E. Pol, Feb 24 2013
CROSSREFS
Sequence in context: A326589 A024794 A326292 * A218025 A091955 A091584
KEYWORD
nonn,more
AUTHOR
Omar E. Pol, Feb 03 2012
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 April 18 12:53 EDT 2024. Contains 371780 sequences. (Running on oeis4.)