The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A334212 Least number k such that n^k + 1 is not squarefree. 2

%I

%S 3,1,5,3,7,1,1,5,11,1,10,7,3,1,17,1,2,1,3,11,10,1,1,13,1,1,10,3,31,1,

%T 2,10,5,1,37,10,2,1,5,2,10,1,1,21,47,1,1,1,3,1,10,1,5,1,3,2,10,1,14,

%U 21,1,1,5,3,21,1,2,3,2,1,10,10,1,1,7,3,10,1

%N Least number k such that n^k + 1 is not squarefree.

%C For n == 1 (mod 4) (n not 1), a(n) <= (n + 1)/2.

%C For n == 3 (mod 4), a(n) = 1.

%C For even n, a(n) <= n + 1.

%C Existence proof for n >= 2 and upper bounds use the binomial formula.

%o (PARI) for(n=2,79, for(k=1,n+1, !issquarefree(n^k+1)&!print1(k", ")&break))

%Y Cf. A013929, A334213, A334214.

%K nonn

%O 2,1

%A _Gionata Neri_, Apr 18 2020

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

Last modified December 2 14:48 EST 2021. Contains 349445 sequences. (Running on oeis4.)