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.

A050063 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 A050063 #9 Sep 07 2015 08:17:22
%S A050063 1,3,2,5,10,13,18,31,62,65,70,83,114,179,262,441,882,885,890,903,934,
%T A050063 999,1082,1261,1702,2587,3490,4489,5750,8337,12826,21163,42326,42329,
%U A050063 42334,42347,42378,42443,42526,42705,43146,44031
%N A050063 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 A050063 Ivan Neretin, <a href="/A050063/b050063.txt">Table of n, a(n) for n = 1..8193</a>
%t A050063 Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 2}, Flatten@Table[2 k, {n, 5}, {k, 2^n}]] (* _Ivan Neretin_, Sep 07 2015 *)
%Y A050063 Cf. A050027, A050031, A050035, A050039, A050043, A050047, A050051, A050055, A050059, A050067, A050071 (similar, but with different initial conditions).
%K A050063 nonn
%O A050063 1,2
%A A050063 _Clark Kimberling_