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 A128939 #2 Mar 30 2012 17:37:54 %S A128939 1,1,1,4,4,4,7,16,16,16,28,64,64,64,112,256,256,256,448,1024,1024, %T A128939 1024,1792,4096,4096,4096,7168,16384,16384,16384,28672,65536,65536, %U A128939 65536,114688,262144,262144,262144,458752,1048576 %N A128939 Maximal product over partitions of n into parts of the form 3k+1. %F A128939 Conjecture. a(n)=1 if n<4, else a(n)=4^[n/4] if n<>4m+3, else a(n)=7*4^([n/4]-1), where [...] denotes the Floor function. (This has been verified up to n=40.) %Y A128939 Cf. A000792, A034893, A094958. %K A128939 nonn %O A128939 1,4 %A A128939 _John W. Layman_, Apr 27 2007