cp's OEIS Frontend

A064551 Ado [Simone Caramel]'s function: a(0) = 1, a(n) = a(n-1) + 2*(Fibonacci(n+1)-n), n > 0.

%I A064551 #45 Jul 19 2025 18:29:15
%S A064551 1,1,1,1,3,9,23,51,103,195,353,619,1061,1789,2981,4925,8087,13221,
%T A064551 21547,35039,56891,92271,149541,242231,392233,634969,1027753,1663321,
%U A064551 2691723,4355745,7048223,11404779,18453871,29859579,48314441,78175075,126490637,204666901,331158797
%N A064551 Ado [Simone Caramel]'s function: a(0) = 1, a(n) = a(n-1) + 2*(Fibonacci(n+1)-n), n > 0.
%C A064551 A Pickover sequence with properties analogous to the primes.
%D A064551 Ado [Simone Caramel], Postings in egroups and newsgroups.
%H A064551 T. D. Noe, <a href="/A064551/b064551.txt">Table of n, a(n) for n = 0..500</a>
%H A064551 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (4,-5,1,2,-1).
%F A064551 From _T. D. Noe_, Oct 12 2007: (Start)
%F A064551 G.f.: (1 - 3x + 2x^2 + x^3 + x^4)/((x-1)^3 (x^2 + x - 1)).
%F A064551 a(n) = 4*a(n-1) - 5*a(n-2) + a(n-3) + 2*a(n-4) - a(n-5). (End)
%F A064551 a(n) = (1/5)*2^(-n)*(-15*2^n + (10-4*sqrt(5))*(1-sqrt(5))^n + (1+sqrt(5))^n*(10+4*sqrt(5))) - n - n^2. - _Jean-François Alcover_, May 28 2013
%F A064551 a(n) = a(n-1) - 2 * A065220(n), n > 0. - _Reinhard Zumkeller_, Sep 13 2013
%F A064551 a(n) = 2*F(n+3) - n^2 - n - 3 = 1 + 2*Sum_{k=1..n} F(k+1) - k = 1 + 2*Sum_{k=1..n} A001924(k-3), F=A000045. - _Ehren Metcalfe_, Dec 27 2018
%F A064551 E.g.f.: 4*exp(x/2)*(5*cosh(sqrt(5)*x/2) + 2*sqrt(5)*sinh(sqrt(5)*x/2))/5 - exp(x)*(3 + x*(2 + x)). - _Stefano Spezia_, Oct 16 2023
%p A064551 a:= proc(n) option remember: a(n-1)+2*(combinat[fibonacci](n+1)-n) end: a(0):=1: for n from 0 to 60 do printf(`%d, `, a(n)) od:
%t A064551 a[0] = f[0] = f[1] = 1; f[n_] := f[n] = f[n - 1] + f[n - 2]; a[n_] := a[n] = a[n - 1] + 2*(f[n] - n); Table[ a[n], {n, 0, 40} ]
%t A064551 LinearRecurrence[{4,-5,1,2,-1},{1,1,1,1,3},50] (* _Harvey P. Dale_, Sep 27 2011 *)
%o A064551 (ARIBAS) function a064551(maxarg: integer); var n,r,rm,q,qm1,qm2: integer; begin qm2 := 0; qm1 := 0; rm := 0; for n := 0 to maxarg do if n < 2 then q := 1; else q := qm1 + qm2; end; qm2 := qm1; qm1 := q; if n = 0 then r := 1; else r := rm + 2*(q - n); end; rm := r; write(r," "); end; end; a064551(35);
%o A064551 (Haskell)
%o A064551 a064551 n = a064551_list !! n
%o A064551 a064551_list = 1 : zipWith (+) a064551_list
%o A064551                    (map (* 2) $ zipWith (-) (drop 2 a000045_list) [1..])
%o A064551 -- _Reinhard Zumkeller_, Sep 13 2013
%Y A064551 Cf. A000045, A064550, A064552, A065220, A001924.
%K A064551 nonn,nice,easy
%O A064551 0,5
%A A064551 _Roger L. Bagula_, Oct 08 2001