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 A282232 #46 Mar 19 2017 19:36:11 %S A282232 0,455,13072,111111,536312,1864135,5227320,12597767,27126736,53543367, %T A282232 98611520,171644935,285080712,455111111,702373672,1052699655, %U A282232 1537920800,2196734407,3075626736,4229854727,5724486040,7635497415,10050931352,13072111111,16814914032,21411103175,27009717280 %N A282232 a(n) = ((3*n + 1)^6 - 1)/9. %C A282232 If n is in the sequence, then so is n followed by q ones, where q is congruent to 0 mod 6. For example, 13072 is a term, so 13072111111 is also. %e A282232 a(2) =81*2^6 + 162*2^5 + 135*2^4 + 60*2^3 + 15*2^2 + 2*2 = 13072. %p A282232 f:=n->((3*n+1)^6-1)/9; [seq(f(n),n=0..30)]; %K A282232 nonn,easy %O A282232 0,2 %A A282232 _Jake Lawrence_, Mar 05 2017 %E A282232 Edited by _N. J. A. Sloane_, Mar 07 2017