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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308467 The smallest positive n-digit 4th power. 1

%I

%S 1,16,256,1296,10000,104976,1048576,10556001,100000000,1003875856,

%T 10098039121,100469346961,1000000000000,10016218555281,

%U 100091400875761,1000417426149376,10000000000000000,100004631514837921,1000028258199628641

%N The smallest positive n-digit 4th power.

%F a(n) = ceiling(10^((n-1)/4))^4. - _Charlie Neder_, Jun 13 2019

%F a(n) = A018074(n-1)^4. - _Michel Marcus_, Jun 13 2019

%e a(1) = 1^4 = 1;

%e a(2) = 2^4 = 16;

%e 3^4 = 81 so no increase in number of digits;

%e a(3) = 4^4 = 256.

%o (MAGMA) sol:=[]; for k in [0..20] do if k mod 4 eq 0 then sol[k+1]:=10^k; else sol[k+1]:=(Floor(10^(k/4)) +1)^4;end if; end for; sol; // _Marius A. Burtea_, Jun 13 2019

%Y Cf. A000583 (4th powers), A018074.

%K nonn,base

%O 1,2

%A _Akshat Kumar Agarwal_, Jun 13 2019

%E a(11)-a(19) from _Charlie Neder_, Jun 13 2019

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.

Last modified August 8 10:26 EDT 2022. Contains 356009 sequences. (Running on oeis4.)