login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130257 Partial sums of the 'lower' odd Fibonacci Inverse A130255. 12

%I #7 Sep 08 2022 08:45:30

%S 1,3,5,7,10,13,16,19,22,25,28,31,35,39,43,47,51,55,59,63,67,71,75,79,

%T 83,87,91,95,99,103,107,111,115,120,125,130,135,140,145,150,155,160,

%U 165,170,175,180,185,190,195,200,205,210,215,220,225,230,235,240,245,250

%N Partial sums of the 'lower' odd Fibonacci Inverse A130255.

%H G. C. Greubel, <a href="/A130257/b130257.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = (n+1)*A130255(n) - A001906(A130255(n)).

%F a(n) = (n+1)*A130255(n) - Fib(2*A130255(n)).

%F G.f.: g(x)=1/(1-x)^2*sum(k>=1, x^Fib(2k-1)).

%t Table[Sum[Floor[(1 + ArcSinh[Sqrt[5]*k/2]/Log[GoldenRatio])/2], {k, 1, n}], {n, 1, 100}] (* _G. C. Greubel_, Sep 09 2018 *)

%o (PARI) for(n=1,100, print1(sum(k=1,n, floor((1+asinh(sqrt(5)*k/2)/log((1+sqrt(5))/2))/2)), ", ")) \\ _G. C. Greubel_, Sep 09 2018

%o (Magma) [(&+[Floor((1+Argsinh(Sqrt(5)*k/2)/Log((1+Sqrt(5))/2))/2): k in [1..n]]): n in [1..100]]; // _G. C. Greubel_, Sep 09 2018

%Y Cf. A000045, A001519, A001906, A130233, A130235, A130236, A130256, A130258, A104161. Lucas inverse: A130241 - A130248.

%K nonn

%O 1,2

%A _Hieronymus Fischer_, May 24 2007

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:44 EDT 2024. Contains 371241 sequences. (Running on oeis4.)