|
%I #12 Aug 29 2018 06:07:08
%S 3,5,8,3,14,40,1270,15874,251984126,28673777890680889,
%T 2806729404119595479093401735,
%U 15973219322678152520589944038429546981629762353084607
%N a(1) = 3, then smallest number such that every partial product + 1 is a distinct square.
%e 3 + 1 = 4, 3*5 + 1 = 16, 3*5*8 + 1 = 121 etc. are squares.
%t p = 1; Do[k = 2; While[ !IntegerQ[Sqrt[p*k + 1]], k++ ]; Print[k]; p *= k, {n, 1, 9}] (* _Ryan Propper_ *)
%Y Cf. A068559, A087335.
%K nonn
%O 1,1
%A _Amarnath Murthy_, Sep 06 2003, May 22 2004
%E Edited by _Don Reble_, Sep 12 2003
%E Entry revised by _N. J. A. Sloane_, Aug 29 2006
|
