|
%I #14 May 29 2019 02:57:34
%S 2,5,9,16,23,35,48,69,87,116,145,189,228,287,345,430,501,605,704,843,
%T 965,1136,1299,1523,1716,1981,2231,2566,2863,3261,3638,4137,4569,5140,
%U 5675,6367,6984,7781,8531,9490,10339,11423,12440,13721,14875,16328,17697,19409
%N a(n) = A030068(4n+3).
%H N. J. A. Sloane, <a href="/A169740/b169740.txt">Table of n, a(n) for n = 0..10000</a>
%t f[1]=1; f[n_?EvenQ]:=f[n]=f[n/2]; f[n_?OddQ]:=f[n]=f[n-1]+f[n-2]; a[n_]:=f[4*n+3]; Table[a[n], {n, 0, 100}] (* _Vincenzo Librandi_, May 27 2019 *)
%o (PARI) {f(n) = if(n==1,1, if(n%2==0, f(n/2), f(n-1) + f(n-2)))};
%o vector(50, n, n--; f(4*n+3)) \\ _G. C. Greubel_, May 29 2019
%o (Sage)
%o def f(n):
%o if (n==1): return 1
%o elif (n%2==0): return f(n/2)
%o else: return f(n-1) + f(n-2)
%o [f(4*n+3) for n in (0..50)] # _G. C. Greubel_, May 29 2019
%Y Cf. A030067, A030068, A169739.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, May 02 2010
|
