Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110614
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A110614
%S A110614 1,5,15,57,215,841,3319,13193,52599,210057,839543,3356809,13424503,
%T A110614 53692553,214759287,859015305,3436017527,13743982729,54975756151,
%U A110614 219902675081,879610001271,3518438606985,14073751631735,56295000934537
%N A110614 a(n+3) = 5*a(n+2) - 2*a(n+1) - 8*a(n), a(0) = 1, a(1) = 5, a(2) = 15.
%C A110614 See comment for A110613.
%F A110614 G.f. (1-8*x^2)/((4*x-1)*(2*x-1)*(x+1)); Program "Superseeker" finds: 
               a(n) + a(n+1) = A063376(n+1)
%p A110614 seriestolist(series((1-8*x^2)/((4*x-1)*(2*x-1)*(x+1)), x=0,25)); -or- 
               Floretion Algebra Multiplication Program, FAMP Code: 2ibasejsumseq[(.5'i 
               - .5'k - .5i' + .5k' - .5'ij' - .5'ji' - .5'jk' - .5'kj')('i + j' 
               + 'ij' + 'ji')] Sumtype is set to: sum[Y[15]] = sum[ * ] (disregarding 
               signs)
%Y A110614 Cf. A110613, A063376.
%Y A110614 Sequence in context: A001552 A165731 A149589 this_sequence A149590 A149591 
               A149592
%Y A110614 Adjacent sequences: A110611 A110612 A110613 this_sequence A110615 A110616 
               A110617
%K A110614 easy,nonn
%O A110614 0,2
%A A110614 Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Jul 31 2005

    
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 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research