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-3 of 3 results.

A057951 Number of prime factors of 10^n - 1 (counted with multiplicity).

Original entry on oeis.org

2, 3, 4, 4, 4, 7, 4, 6, 6, 6, 4, 9, 5, 6, 8, 8, 4, 11, 3, 9, 9, 9, 3, 12, 7, 8, 9, 10, 7, 15, 5, 13, 8, 8, 9, 14, 5, 5, 8, 13, 6, 17, 6, 13, 12, 8, 4, 15, 6, 12, 10, 11, 6, 16, 10, 14, 8, 10, 4, 22, 9, 7, 16, 17, 9, 17, 5, 12, 8, 14, 4, 20, 5, 9, 14, 8, 10, 18
Offset: 1

Views

Author

Patrick De Geest, Nov 15 2000

Keywords

Links

Crossrefs

bigomega(b^n-1): this sequence (b=10), A057952 (b=9), A057953 (b=8), A057954 (b=7), A057955 (b=6), A057956 (b=5), A057957 (b=4), A057958 (b=3), A046051 (b=2).
Cf. A001222, A002283, A046053, A085035, A003020, A046107, A005422, A061075, A102380, A095370, A147556, A081317, A081318, A102347, A112505.

Programs

Formula

Mobius transform of A085035 - T. D. Noe, Jun 19 2003
a(n) = Omega(10^n -1) = Omega(R_n) + 2 = A046053(n) + 2 {where Omega(n) = A001222(n) and R_n = (10^n - 1)/9 = A002275(n)}. - Lekraj Beedassy, Jun 09 2006
a(n) = A001222(A002283(n)). - Ray Chandler, Apr 22 2017

Extensions

Erroneous b-file replaced by Ray Chandler, Apr 26 2017

A102146 a(n) = sigma(10^n - 1), where sigma(n) is the sum of positive divisors of n.

Original entry on oeis.org

13, 156, 1520, 15912, 148512, 2042880, 14508000, 162493344, 1534205464, 16203253248, 144451398000, 2063316971520, 14903272088640, 158269280832000, 1614847741624320, 17205180696931968, 144444514193267496
Offset: 1

Views

Author

Jun Mizuki (suzuki32(AT)sanken.osaka-u.ac.jp), Feb 14 2005

Keywords

Links

Crossrefs

Cf. A000203, A001270, A002283, A003020, A005422, A046053, A046107, A046412, A046415, A046416, A046417, A046418, A046419, A046420, A057951, A059892, A061075, A070528, A070529, A081317, A081318, A085035, A095370, A095413, A095414, A095417, A095418, A102347, A102380, A112505, A147556, A295503, A366669.

Programs

  • Mathematica
    DivisorSigma[1,10^Range[20]-1] (* Harvey P. Dale, Jan 05 2012 *)
  • PARI
    a(n) = sigma(10^n-1); \\ Michel Marcus, Apr 22 2017

Formula

a(n) = A000203(A002283(n)). - Ray Chandler, Apr 22 2017

A081318 Integers n such that the reciprocal of the largest prime factor of 10^n-1 is not a repeating decimal fraction with a period of n.

Original entry on oeis.org

6, 18, 22, 30, 32, 38, 42, 46, 54, 66, 74, 78, 82, 90, 94, 96, 110, 118, 132, 138, 146, 154, 162, 174, 186, 194, 198, 206, 210, 218, 228, 231, 240, 242, 254, 258, 260, 264, 266, 268, 274, 282, 284, 286, 298, 300, 306, 310, 318, 322, 334, 338, 344, 348
Offset: 1

Views

Author

Hugo Pfoertner, Mar 18 2003

Keywords

Comments

For all but three of the terms through a(41)=274, the reciprocal of the largest prime factor of 10^a(n)-1 is a decimal fraction with a period of a(n)/2. Of the three exceptions, there are two (a(32)=231 and a(38)=264) where the period is a(n)/3, and one (a(19)=132) where the period is a(n)/4. - Jon E. Schoenfield, Jun 27 2010

Examples

			30 is in the sequence because the factorization of 10^30-1 is 3^3*7*11*13*31*37*41*211*241*271*2161*9091*2906161 and 2906161 occurs already in 10^15-1=3^3*31*37*41*271*2906161 producing a decimal fraction with a period of 15, (1/2906161=0.000000344096559000000344096559000000344...)

Links

Crossrefs

Cf. A081317.

Formula

Integers n such that A061075(n) is not equal to A005422(n).

Extensions

More terms from Hans Havermann, May 31 2003
Terms a(31)-a(37) from Jon E. Schoenfield, Jun 19 2010
Terms a(38)-a(41) added, link added, and earlier comment expanded by Jon E. Schoenfield, Jun 27 2010
a(42)-a(54) from Max Alekseyev, Aug 17 2013, Apr 26 2022
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.