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
A110614 a(n+3) = 5*a(n+2) - 2*a(n+1) - 8*a(n), a(0) = 1, a(1) = 5, a(2) = 15. +0
2
1, 5, 15, 57, 215, 841, 3319, 13193, 52599, 210057, 839543, 3356809, 13424503, 53692553, 214759287, 859015305, 3436017527, 13743982729, 54975756151, 219902675081, 879610001271, 3518438606985, 14073751631735, 56295000934537 (list; graph; listen)
OFFSET

0,2

COMMENT

See comment for A110613.

FORMULA

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)

MAPLE

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)

CROSSREFS

Cf. A110613, A063376.

Sequence in context: A114947 A137959 A001552 this_sequence A019045 A066886 A079569

Adjacent sequences: A110611 A110612 A110613 this_sequence A110615 A110616 A110617

KEYWORD

easy,nonn

AUTHOR

Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Jul 31 2005

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research