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.

A082386 Let S(0) = {1} and for k >= 1, let S(k) = {S(k-1), S(k-1), 2T}, where T = sum of terms in S(k-1). Sequence is S(infinity).

This page as a plain text file.
%I A082386 #6 Mar 30 2012 18:39:17
%S A082386 1,1,2,1,1,2,8,1,1,2,1,1,2,8,32,1,1,2,1,1,2,8,1,1,2,1,1,2,8,32,128,1,
%T A082386 1,2,1,1,2,8,1,1,2,1,1,2,8,32,1,1,2,1,1,2,8,1,1,2,1,1,2,8,32,512,1,1,
%U A082386 2,1,1,2,8,1,1,2,1,1,2,8,32,1,1,2,1,1,2,8,1,1,2,1,1,2,8,32,128,1,1,2,1,1,2
%N A082386 Let S(0) = {1} and for k >= 1, let S(k) = {S(k-1), S(k-1), 2T}, where T = sum of terms in S(k-1). Sequence is S(infinity).
%F A082386 For k>=2, a(2^k-1)=2*4^(k-2).
%Y A082386 Cf. A082388.
%K A082386 nonn
%O A082386 0,3
%A A082386 _Benoit Cloitre_, Apr 14 2003