Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055843
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A055843
%S A055843 1,13,85,385,1375,4147,11011,26455,58630,121550,238238,445094,797810,
%T A055843 1379210,2309450,3759074,5965487,9253475,14060475,20967375,30735705,
%U A055843 44352165,63081525,88529025,122713500,168152556,227961228,305965660
%N A055843 A second order recursive sequence.
%C A055843 Partial sums of A052181.
%D A055843 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, 
               pps. 194-196.
%F A055843 a(n)=(4n+9)*C(n+8, 8)/9.
%e A055843 G.f.(x)=(1+3x)/(1-x)^10.
%Y A055843 Cf. A052181.
%Y A055843 Cf. A093561 ((4, 1) Pascal, column m=9).
%Y A055843 Sequence in context: A163688 A010025 A001848 this_sequence A003764 A082036 
               A037060
%Y A055843 Adjacent sequences: A055840 A055841 A055842 this_sequence A055844 A055845 
               A055846
%K A055843 easy,nonn
%O A055843 0,2
%A A055843 Barry E. Williams, May 30 2000

    
page 1

Search completed in 0.001 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 5 20:25 EST 2009. Contains 170428 sequences.


AT&T Labs Research