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!)
A216474 Smallest k such that k*!n +1 is an n-th power. 0

%I #14 Sep 10 2012 12:01:22

%S 3,13,455,71,93565703,40765959421975394881,27507928745358015883503,

%T 4005456298012605183835102420301535996,

%U 64381553566633030980078485248402475462864768,67848687916710307026239471566668726955520894650602664910832487

%N Smallest k such that k*!n +1 is an n-th power.

%C !n is a subfactorial number (A000166).

%e a(4) = 455 because 455*!4 + 1 = 455*9+1 = 4096 = 4^6.

%t a={}; Do[k = 2; While[ !IntegerQ[(k^n - 1)/Subfactorial[n]], k++ ]; AppendTo[a, (k^n-1)/Subfactorial[n]], {n, 2, 11}]; a

%Y Cf. A000166.

%K nonn

%O 2,1

%A _Michel Lagneau_, Sep 10 2012

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 September 5 07:27 EDT 2024. Contains 375686 sequences. (Running on oeis4.)