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

A087026 Euler's totient of n-th cyclic number.

Original entry on oeis.org

77760, 1382399778816000, 98221093640386560, 1053590173895849103360, 821095240766161265049600000, 511883170649353472639948811682935064652736000, 410719109641406326635474611575828305116907342385175347200
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 30 2003

Keywords

Comments

Calculated with Dario Alpern's ECM.
Extended using factors of 10^(A001913(n)-1)-1, see Kamada link.

Crossrefs

Formula

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

Extensions

a(12)-a(42) from Ray Chandler, Nov 16 2011

A087020 Greatest prime factor of n-th cyclic number.

Original entry on oeis.org

37, 5882353, 333667, 513239, 121499449, 11111111111111111111111, 154083204930662557781201849, 39526741, 9999999900000001, 59779577156334533866654838281, 119968369144846370226083377, 8396862596258693901610602298557167100076327481
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 30 2003

Keywords

Comments

A004042(n) factorized with Dario Alpern's ECM.
Extended using factors of 10^(A001913(n)-1)-1, see Kamada link.

Examples

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

Crossrefs

Formula

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

Extensions

a(12) from Ray Chandler, Nov 16 2011

A087024 Number of divisors of n-th cyclic number.

Original entry on oeis.org

32, 384, 1280, 576, 1536, 384, 1536, 4194304, 16777216, 3538944, 1769472, 110592, 221184, 13824, 6912, 48318382080, 9663676416, 3538944, 75497472, 14155776, 56623104, 884736, 55296, 57982058496, 3710851743744, 37748736, 695784701952, 27648, 27648, 2654208
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 30 2003

Keywords

Comments

Calculated with Dario Alpern's ECM.
Extended using factors of 10^(A001913(n)-1)-1, see Kamada link.

Crossrefs

Formula

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

Extensions

a(12)-a(42) from Ray Chandler, Nov 16 2011

A087023 Maximal exponent in prime factorization of n-th cyclic number.

Original entry on oeis.org

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, 2, 2, 2, 3, 3, 2, 6, 2, 3
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 30 2003

Keywords

Comments

A004042(n) factorized with Dario Alpern's ECM.
Extended using factors of 10^(A001913(n)-1)-1, see Kamada link.

Examples

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

Crossrefs

Formula

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

Extensions

a(12)-a(42) from Ray Chandler, Nov 16 2011
a(43)-a(51) from Max Alekseyev, May 14 2022
Showing 1-4 of 4 results.