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.

A227533 Smallest e > 1 such that (2n)^e is a totient, or 0 if no such e exists.

Original entry on oeis.org

2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 4, 2, 3, 2, 2, 2, 4, 2, 2, 2, 2, 2, 3, 2, 5, 2, 2, 2, 2, 2, 2, 3, 3, 2, 4, 2, 15, 2, 2, 4, 2, 2, 3, 2, 3, 2, 4, 2, 2, 2, 2, 2, 3, 2, 7, 2, 2, 2, 2, 2, 2, 2, 4, 2, 3, 2, 2, 2, 2, 3, 3, 2, 8, 2, 2, 4, 15, 2, 2, 3, 2, 2, 5, 2, 4, 2, 2
Offset: 1

Views

Author

Keywords

Comments

Conjecture: a(n) > 0 for all n.

Examples

			a(1) = 2 because phi(5) = 2^2. a(11) = 3 because phi(13315) = 22^3 but phi(k) is not equal to 22^2 for any k.
		

Crossrefs

Programs

  • PARI
    a(n)=my(k=2);while(!istotient((2*n)^k),k++);k

A227535 Exponents e such that n^e is the least totient for some even n and all even k < n have a totient of the form k^f for some f < e.

Original entry on oeis.org

2, 3, 4, 5, 15, 17, 23, 42, 44, 47, 68, 80, 107, 130, 142, 162, 184
Offset: 1

Views

Author

Keywords

Comments

Records in A227533.

Crossrefs

Programs

  • PARI
    r=0;forstep(n=2,1e5,2, t=1; while(!istotient(n^t++),); if(t>r, r=t;print1(t", ")))
    \\ See also A227533 for a more efficient method of computing terms.

Formula

a(n) = A227533(A227534(n)/2).

Extensions

a(14) from Charles R Greathouse IV, Jul 16 2013
a(15) from Charles R Greathouse IV, Jul 17 2013
a(16)-a(17) from Charles R Greathouse IV, Jul 19 2013
Showing 1-2 of 2 results.