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.

Showing 1-2 of 2 results.

A130084 Smallest number whose tenth power has at least n digits.

Original entry on oeis.org

1, 2, 2, 2, 3, 4, 4, 6, 7, 8, 10, 13, 16, 20, 26, 32, 40, 51, 64, 80, 100, 126, 159, 200, 252, 317, 399, 502, 631, 795, 1000, 1259, 1585, 1996, 2512, 3163, 3982, 5012, 6310, 7944, 10000, 12590, 15849, 19953, 25119, 31623, 39811, 50119, 63096, 79433, 100000
Offset: 1

Views

Author

Klaus Brockhaus, May 07 2007

Keywords

Comments

Powers of tenth root of 10 rounded up.

Examples

			3^10 = 59049 has five digits, 4^10 = 1048576 has seven digits, hence a(6) = a(7) = 4.
		

Crossrefs

Cf. A011279, A011557 (powers of 10), A017936 (smallest number whose square has n digits), A018005 (smallest number whose cube has n digits), A018074 (smallest number whose fourth power has n digits), A018143 (smallest number whose fifth power has n digits), A130080 to A130083 (smallest number whose sixth ... ninth power has n digits).

Programs

  • Magma
    [Ceiling(Root(10^(n-1),10)): n in [1..51]];
    
  • Mathematica
    Table[(Ceiling[10^((n - 1)/10)]), {n, 1, 60}] (* Vincenzo Librandi, Sep 20 2013 *)
  • Python
    from sympy import integer_nthroot
    def A130084(n): return (lambda x:x[0]+(not x[1]))(integer_nthroot(10**(n-1),10)) # Chai Wah Wu, Jun 20 2024

Formula

a(n) = ceiling(10^((n-1)/10)).

A383464 a(n) = 8*n^2 - 5*n + 1.

Original entry on oeis.org

1, 4, 23, 58, 109, 176, 259, 358, 473, 604, 751, 914, 1093, 1288, 1499, 1726, 1969, 2228, 2503, 2794, 3101, 3424, 3763, 4118, 4489, 4876, 5279, 5698, 6133, 6584, 7051, 7534, 8033, 8548, 9079, 9626, 10189, 10768, 11363, 11974, 12601, 13244, 13903, 14578, 15269
Offset: 0

Views

Author

N. J. A. Sloane, Jun 26 2025

Keywords

Comments

This is equal to A139272(n) + 1, but has its own entry because of an important geometrical interpretation.
Definition: A k-legged Wu is a pencil of k semi-infinite lines originating from a common point.
A 2-legged Wu is a long-legged V (see A130883), and a 3-legged Wu is a long-legged Wu as in A140064.
Theorem (David Cutler, Jonathan Pei, and Edward Xiong, Jun 24 2025): a(n) is the maximum number of regions in the plane that can be formed from n copies of a 4-legged Wu.
Proof: See "Cutting a pancake with an exotic knife".

References

  • David O. H. Cutler and Neil J. A. Sloane, Cutting a pancake with an exotic knife, Paper in preparation, Sep 05 2025

Crossrefs

Programs

  • Magma
    I:=[1, 4, 23]; [n le 3 select I[n] else 3*Self(n-1)-3* Self(n-2)+Self(n-3): n in [1..40]]; // Vincenzo Librandi, Jun 27 2025
  • Mathematica
    LinearRecurrence[{3,-3,1},{1,4,23},50] (* Vincenzo Librandi, Jun 27 2025 *)

Formula

G.f.: (1 + x + 14*x^2)/(1 - x)^3.
E.g.f.: exp(x)*(1 + 3*x + 8*x^2). - Stefano Spezia, Jun 30 2025
Showing 1-2 of 2 results.