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 A094357 #8 Dec 05 2013 19:56:50 %S A094357 3,8,15,323,115599,13441619843,180680260779332208399 %N A094357 Numbers of the form k^2 -1 such that every partial product is also of the form k^2-1. %C A094357 Next term <= 32645356640144805339103579127542660095683 : The number (sqrt( product( a[j], j=1 .. n )+1)-1)^2-1 does satisfy the requirements for the next term, but is this always the smallest solution ? - _M. F. Hasler_, May 15 2007 %F A094357 a(n+1) = A084702(A093959(n)-1). - _David Wasserman_, May 03 2007 %F A094357 For n>1, a[n+1] <= floor( sqrt( product( a[j], j=1 .. n )))^2-1 - _M. F. Hasler_, May 15 2007 %e A094357 3, 8 and 15 are 1 less than a square and so are the numbers 3, 3*8, 3*8*15. %Y A094357 Cf. A084702, A093959. %K A094357 hard,nonn %O A094357 1,1 %A A094357 _Amarnath Murthy_, May 22 2004 %E A094357 More terms from _David Wasserman_, May 03 2007