cp's OEIS Frontend

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.

A050059 a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p for n >= 4.

This page as a plain text file.
%I A050059 #9 Sep 07 2015 08:16:37
%S A050059 1,3,1,4,8,11,15,26,52,55,59,70,96,151,221,372,744,747,751,762,788,
%T A050059 843,913,1064,1436,2183,2945,3788,4852,7035,10823,17858,35716,35719,
%U A050059 35723,35734,35760,35815,35885,36036,36408,37155,37917
%N A050059 a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.
%H A050059 Ivan Neretin, <a href="/A050059/b050059.txt">Table of n, a(n) for n = 1..8193</a>
%t A050059 Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 1}, Flatten@Table[2 k, {n, 5}, {k, 2^n}]] (* _Ivan Neretin_, Sep 07 2015 *)
%Y A050059 Cf. A050027, A050031, A050035, A050039, A050043, A050047, A050051, A050055, A050063, A050067, A050071 (similar, but with different initial conditions).
%K A050059 nonn
%O A050059 1,2
%A A050059 _Clark Kimberling_