Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055848
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055848 A second order recursive sequence. +0
2
1, 15, 105, 495, 1815, 5577, 15015, 36465, 81510, 170170, 335478, 629850, 1133730, 1967070, 3304290, 5393454, 8580495, 13339425, 20309575, 30341025, 44549505, 64382175, 91695825, 128849175, 178811100, 245286756, 332863740, 447180580 (list; graph; listen)
OFFSET

0,2

REFERENCES

A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.

FORMULA

a(n)=(2n+3)*C(n+8, 8)/3. G.f.(x)=(1+5x)/(1-x)^10.

CROSSREFS

Cf. A054487.

Cf. A093563 ((6, 1) Pascal, column m=9). Partial sums of A054487.

Sequence in context: A022610 A006857 A000478 this_sequence A058085 A060218 A165892

Adjacent sequences: A055845 A055846 A055847 this_sequence A055849 A055850 A055851

KEYWORD

easy,nonn

AUTHOR

Barry E. Williams, Jun 03 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research