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 A307785 #11 Apr 29 2019 17:23:25 %S A307785 2,3,4,5,6,7,6,3,4,5,6,7,6,3,4,5,6,7,6,3,4,5,6,7,6,3,4,5,6,7,6,3,4,5, %T A307785 6,7,6,3,4,5,6,7,8,7,4,5,6,5,2,3,4,5,6,7,6,2,3,4,5,6,7,8,9,8,5,4,5,6, %U A307785 7,8,7,5,6,7,6,4,5,6,7,8,9,10,9,6,5,6,7 %N A307785 a(n) is the cubic root of A175428(n) + A175428(n+1). %C A307785 The sum of two consecutive terms of A175428 is always a perfect cube. %H A307785 Rémy Sigrist, <a href="/A307785/b307785.txt">Table of n, a(n) for n = 1..10000</a> %F A307785 a(n)^3 = A175428(n) + A175428(n+1). %e A307785 for n = 6: %e A307785 - A175428(6) + A175428(7) = 135 + 208 = 343 = 7^3, %e A307785 - hence a(6) = 7. %o A307785 (PARI) p=1; s=0; for (n=1, 87, s+=2^p; for (v=1, oo, if (!bittest(s,v) && ispower(p+v, 3, &q), print1 (q ", "); p=v; break))) %Y A307785 Cf. A175428. %K A307785 nonn %O A307785 1,1 %A A307785 _Rémy Sigrist_, Apr 28 2019