login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081949 Smallest square which is one more than the product of n (not necessarily distinct) numbers > 1. 1

%I #4 Dec 05 2013 19:56:03

%S 4,9,9,25,49,225,289,961,4225,16129,16129,201601,261121,1050625,

%T 1050625,62995969,67092481,67092481,67092481,822140929,4295098369,

%U 17179607041,129923481601,129923481601,274876858369,274876858369,4398042316801

%N Smallest square which is one more than the product of n (not necessarily distinct) numbers > 1.

%e a(2) = a(3) = 9 = 2*4+1 = 2*2*2 +1,a(6) = 225= 2*2*2*2*2*7 +1

%o (PARI) A = vector(30); count = 0; i = 1; while(count < 30, i = i + 1; n = i*i; k = bigomega(n - 1); while(count < k, count = count + 1; A[count] = n))

%Y Cf. A081948.

%K nonn

%O 1,1

%A _Amarnath Murthy_, Apr 02 2003

%E More terms from _David Wasserman_, Jul 20 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:45 EDT 2024. Contains 371975 sequences. (Running on oeis4.)