login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087023 Maximal exponent in prime factorization of n-th cyclic number. 0
3, 2, 4, 2, 2, 2, 2, 3, 3, 5, 2, 2, 2, 2, 2, 4, 3, 3, 3, 2, 2, 2, 2, 3, 3, 3, 5, 2, 2, 2, 5, 2, 7, 2, 3, 2, 2, 5, 3, 4, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

A004042(n) factorized with Dario Alpern's ECM.

Extended using factors of 10^(A001913(n)-1)-1, see Kamada link.

LINKS

Dario A. Alpern, Factorization using the Elliptic Curve Method.

Makoto Kamada, Factorizations of 11...11 (Repunit)

Eric Weisstein's World of Mathematics, Cyclic Number

FORMULA

a(n) = A051903(A004042(n+1)).

EXAMPLE

A004042(2) = 142857 = 37*13*11*3^3, therefore a(1) = 3.

CROSSREFS

Cf. A001913, A087020-A087026.

Sequence in context: A139583 A073314 A144808 * A089214 A057038 A175798

Adjacent sequences:  A087020 A087021 A087022 * A087024 A087025 A087026

KEYWORD

nonn,more,hard

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 30 2003

EXTENSIONS

a(12)-a(42) from Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 16 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 00:26 EST 2012. Contains 205567 sequences.