This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A169740 #14 May 29 2019 02:57:34 %S A169740 2,5,9,16,23,35,48,69,87,116,145,189,228,287,345,430,501,605,704,843, %T A169740 965,1136,1299,1523,1716,1981,2231,2566,2863,3261,3638,4137,4569,5140, %U A169740 5675,6367,6984,7781,8531,9490,10339,11423,12440,13721,14875,16328,17697,19409 %N A169740 a(n) = A030068(4n+3). %H A169740 N. J. A. Sloane, <a href="/A169740/b169740.txt">Table of n, a(n) for n = 0..10000</a> %t A169740 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 A169740 (PARI) {f(n) = if(n==1,1, if(n%2==0, f(n/2), f(n-1) + f(n-2)))}; %o A169740 vector(50, n, n--; f(4*n+3)) \\ _G. C. Greubel_, May 29 2019 %o A169740 (Sage) %o A169740 def f(n): %o A169740 if (n==1): return 1 %o A169740 elif (n%2==0): return f(n/2) %o A169740 else: return f(n-1) + f(n-2) %o A169740 [f(4*n+3) for n in (0..50)] # _G. C. Greubel_, May 29 2019 %Y A169740 Cf. A030067, A030068, A169739. %K A169740 nonn %O A169740 0,1 %A A169740 _N. J. A. Sloane_, May 02 2010