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.

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

This page as a plain text file.
%I A050070 #10 Sep 08 2015 08:52:55
%S A050070 1,3,4,5,8,9,12,16,21,22,25,29,34,42,51,63,79,80,83,87,92,100,109,121,
%T A050070 137,158,180,205,234,268,310,361,424,425,428,432,437,445,454,466,482,
%U A050070 503,525,550,579,613,655
%N A050070 a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p<n-1<=2^(p+1), for m >= 4.
%H A050070 Ivan Neretin, <a href="/A050070/b050070.txt">Table of n, a(n) for n = 1..8193</a>
%t A050070 Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 4}, Flatten@Table[k, {n, 5}, {k, 2^n}]] (* _Ivan Neretin_, Sep 08 2015 *)
%Y A050070 Cf. similar sequences, with different initial conditions, listed in A050034.
%K A050070 nonn
%O A050070 1,2
%A A050070 _Clark Kimberling_