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 A205592 #11 Nov 02 2022 16:54:05 %S A205592 1,1,1,2,1,1,4,1,1,2,4,4,2,1,1,4,4,4,8,2,2,2,1,1,8,4,4,8,8,8,4,2,2,4, %T A205592 1,1,2,8,8,8,4,4,16,8,8,16,4,4,4,2,2,8,1,1,2,2,2,16,8,8,16,4,4,8,16, %U A205592 16,16,8,8,32,4,4,8,4,4,4,2,2,16,1,1,2,2,2,4 %N A205592 a(2) = 1, a(3k) = a(3k+1) = a(2k), a(3k+2) = 2a(2k+1) for k >= 1. %H A205592 Joseph Myers, <a href="/A205592/b205592.txt">Table of n, a(n) for n = 2..1000</a> %H A205592 <a href="http://www.bmoc.maths.org/home/bmo2-2012.pdf">2011/12 British Mathematical Olympiad Round 2</a>, Problem 2. %H A205592 <a href="/index/O#Olympiads">Index to sequences related to Olympiads and other Mathematical competitions</a> %F A205592 a(n) = A205591(n) - A205591(n-1). %Y A205592 Cf. A205591, A205593, A205594, A205595, A205596. %Y A205592 Cf. A335933. %K A205592 easy,nonn %O A205592 2,4 %A A205592 _Joseph Myers_, Jan 29 2012