cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A308467 The smallest positive n-digit 4th power.

This page as a plain text file.
%I A308467 #55 Jul 18 2025 14:40:23
%S A308467 1,16,256,1296,10000,104976,1048576,10556001,100000000,1003875856,
%T A308467 10098039121,100469346961,1000000000000,10016218555281,
%U A308467 100091400875761,1000417426149376,10000000000000000,100004631514837921,1000028258199628641
%N A308467 The smallest positive n-digit 4th power.
%H A308467 Harvey P. Dale, <a href="/A308467/b308467.txt">Table of n, a(n) for n = 1..1000</a>
%F A308467 a(n) = ceiling(10^((n-1)/4))^4. - _Charlie Neder_, Jun 13 2019
%F A308467 a(n) = A018074(n-1)^4. - _Michel Marcus_, Jun 13 2019
%e A308467 a(1) = 1^4 = 1;
%e A308467 a(2) = 2^4 = 16;
%e A308467 3^4 = 81 so no increase in number of digits;
%e A308467 a(3) = 4^4 = 256.
%t A308467 Ceiling[Surd[10^Range[0,20],4]]^4 (* _Harvey P. Dale_, Jul 18 2025 *)
%o A308467 (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 A308467 Cf. A000583 (4th powers), A018074.
%K A308467 nonn,base
%O A308467 1,2
%A A308467 _Akshat Kumar Agarwal_, Jun 13 2019
%E A308467 a(11)-a(19) from _Charlie Neder_, Jun 13 2019