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 A119350 #3 Mar 30 2012 17:37:54 %S A119350 1,1,4,1,1,1,1,6,1,1,4,1,1,1,1,1,1,1,1,10,1,1,4,1,1,1,1,6,1,1,4,1,1,1, %T A119350 1,1,1,1,1,1,1,1,1,1,1,1,1,18,1,1,4,1,1,1,1,6,1,1,4,1,1,1,1,1,1,1,1, %U A119350 10,1,1,4,1,1,1,1,6,1,1,4,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1 %N A119350 First differences of A118374. %F A119350 Conjecture. Define g(1)=1 and, for i>1, g(i)=2*g(i-1)+2^(i-2). Also define h(1)=1, h(2)=4 and, for i>2, h(i)=h(i-1)+2^(i-2). Then a(n)=h(i) if n=g(i), a(n)=1 if g(i)-2^(i-2)<=n<g(i) and a(n)=a(n-g(i-1)) if g(i-1)<n<g(i)-2^(i-2). (This has been verified for the first 1000 terms.) %Y A119350 Cf. A118374, A114889, A114890. %K A119350 nonn %O A119350 1,3 %A A119350 _John W. Layman_, May 23 2006