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.

User: Akshat Kumar

Akshat Kumar's wiki page.

Akshat Kumar has authored 1 sequences.

A308467 The smallest positive n-digit 4th power.

Original entry on oeis.org

1, 16, 256, 1296, 10000, 104976, 1048576, 10556001, 100000000, 1003875856, 10098039121, 100469346961, 1000000000000, 10016218555281, 100091400875761, 1000417426149376, 10000000000000000, 100004631514837921, 1000028258199628641
Offset: 1

Author

Akshat Kumar Agarwal, Jun 13 2019

Keywords

Examples

			a(1) = 1^4 = 1;
a(2) = 2^4 = 16;
3^4 = 81 so no increase in number of digits;
a(3) = 4^4 = 256.
		

Crossrefs

Cf. A000583 (4th powers), A018074.

Programs

  • 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
  • Mathematica
    Ceiling[Surd[10^Range[0,20],4]]^4 (* Harvey P. Dale, Jul 18 2025 *)

Formula

a(n) = ceiling(10^((n-1)/4))^4. - Charlie Neder, Jun 13 2019
a(n) = A018074(n-1)^4. - Michel Marcus, Jun 13 2019

Extensions

a(11)-a(19) from Charlie Neder, Jun 13 2019