login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120475 a(n) = Sum_{m=1..n} (A000045(m)*(A004001(m+1) - 2*A004001(m) + A004001(m-1)). 2
-1, 0, -2, 1, 1, -7, -7, 14, 14, 14, -75, 69, -164, -164, -164, 823, 823, 823, 823, -5942, 5004, 5004, -23653, 22715, -52310, -52310, 144108, -173703, -173703, -173703, -173703, 2004606, 2004606, 2004606, 2004606, 2004606, -22153211, 16934958, 16934958, 16934958, -148645183, 119269113 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..42.

MAPLE

A000045 := proc(n) option remember ; combinat[fibonacci](n) ; end: A004001 := proc(n) option remember ; if n <= 0 then 0 ; elif n <= 2 then 1; else A004001(A004001(n-1))+A004001(n-A004001(n-1)) ; fi ; end: A120475 := proc(n) add( A000045(m)*(A004001(m+1)-2*A004001(m)+A004001(m-1)), m=1..n) ; end: seq(A120475(n), n=1..80) ; # R. J. Mathar, Sep 18 2007

MATHEMATICA

Conway[0] = 0; Conway[1] = Conway[2] = 1; Conway[n_Integer?Positive] := Conway[n] = Conway[Conway[n - 1]] + Conway[n - Conway[n - 1]] a[n_] := Fibonacci[n]*(Conway[n + 1] - 2*Conway[n] + Conway[n - 1]) Table[Sum[a[m], {m, 1, n}], {n, 1, 30}]

CROSSREFS

Cf. A000045, A004001, A120474.

Sequence in context: A176305 A139349 A168347 * A086738 A245803 A198941

Adjacent sequences:  A120472 A120473 A120474 * A120476 A120477 A120478

KEYWORD

sign

AUTHOR

Roger L. Bagula, Jul 07 2006

EXTENSIONS

Edited by N. J. A. Sloane, Aug 14 2006

More terms from R. J. Mathar, Sep 18 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 01:09 EDT 2021. Contains 345154 sequences. (Running on oeis4.)