Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123231
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123231 Row sums of A123230. +0
1
1, 2, 1, 3, 2, 5, 3, 8, 5, 13, 8, 21, 13, 34, 21, 55, 34, 89, 55, 144, 89, 233, 144, 377, 233, 610, 377, 987, 610, 1597, 987, 2584, 1597, 4181, 2584, 6765, 4181, 10946, 6765, 17711, 10946, 28657, 17711, 46368, 28657, 75025, 46368, 121393, 75025, 196418 (list; graph; listen)
OFFSET

1,2

COMMENT

All a(n) are Fibonacci numbers A000045[n]: a(2n-1) = Fibonacci[n], a(2n) = Fibonacci[n+2], a(2n-1) = a(2n+2). - Alexander Adamchuk (alex(AT)kolmogorov.com), Oct 08 2006

FORMULA

a(n) = Fibonacci[A028242[n+2]]. a(n) = Fibonacci[A030451[n+1]] = Fibonacci[3/4 -(-1)^(n+1)*3/4 +(n+1)/2]. - Alexander Adamchuk (alex(AT)kolmogorov.com), Oct 08 2006

MATHEMATICA

p[0, x] = 1; p[1, x] = x + 1; p[k_, x_] := p[k, x] = x*p[k - 1, x] + (-1)^(n + 1)p[k - 2, x]; Table[Sum[CoefficientList[p[n, x], x][[m]], {m, 1, n + 1}], {n, 0, 20}]

CROSSREFS

Cf. A053602, A051792.

Cf. A000045, A028242, A030451.

Sequence in context: A132091 A051792 A053602 this_sequence A058736 A097451 A005916

Adjacent sequences: A123228 A123229 A123230 this_sequence A123232 A123233 A123234

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Oct 06 2006

EXTENSIONS

More terms from Alexander Adamchuk (alex(AT)kolmogorov.com), Oct 08 2006

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research