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.

A069215 Numbers n such that phi(n) = reversal(n).

Original entry on oeis.org

1, 21, 63, 270, 291, 2991, 6102, 46676013, 69460293, 2346534651, 6313047393, 23400000651, 80050617822, 234065340651, 234659934651, 2340000000651, 2530227348360, 2934000006591
Offset: 1

Views

Author

Joseph L. Pe, Apr 11 2002

Keywords

Comments

If 10^n-3 is prime (n is in the sequence A089765) and m=3*(10^n-3) then m is in this sequence, for example 299999999999999991 is a term of this sequence because 299999999999999991=3*(10^17-3) and 17 is in the sequence A089675. So 3*(10^A089675-3) is a subsequence of this sequence, A101700 is this subsequence. - Farideh Firoozbakht, Dec 26 2004
A072395 is a subsequence of this sequence. If m is in the sequence and 10 doesn't divide m then reversal(m) is in the sequence A085331, so see Comments on A085331. - Farideh Firoozbakht, Jan 09 2005
If p=(79*10^(4n+1)-83)/101 is prime then 3p is in the sequence. The proof is easy. 21, 2346534651 & 3*(79*10^2697-83)/101 are the first three such terms. - Farideh Firoozbakht, Apr 22 2008, Aug 16 2008
a(19) > 10^13. - Giovanni Resta, Aug 07 2019

Examples

			phi(291) = 192.
phi(6102) = 2016 = reversal(6102), so 6102 belongs to the sequence.
		

Crossrefs

Programs

  • Mathematica
    Do[If[EulerPhi[n] == FromDigits[Reverse[IntegerDigits[n]]], Print[n]], {n, 1, 10^5}]
  • PARI
    for( n=1,1e9, A004086(n)==eulerphi(n) & print1(n","))

Extensions

More terms from Farideh Firoozbakht, Aug 31 2004
One more term from Farideh Firoozbakht, Jan 09 2005
a(11)-a(13) from Donovan Johnson, Feb 03 2012
a(14)-a(15) from Giovanni Resta, Oct 28 2012
a(16)-a(18) from Giovanni Resta, Aug 07 2019

A085331 Numbers n such that phi(rev(n))=n.

Original entry on oeis.org

1, 12, 36, 192, 1992, 2016, 31067664, 39206496, 1564356432, 3937403136, 15600000432, 22871605008, 156043560432, 156439956432, 1560000000432, 1956000004392
Offset: 1

Views

Author

Labos Elemer, Jul 04 2003

Keywords

Comments

rev(2*(10^k-4)) = 3*(10^k-3). If 10^k-3 is prime, then phi(3*(10^k-3)) = 2*(10^k-4), so 2*(10^k-4) is a term. 10^1-3=7 is prime, so 2*(10^1-4)=12 is a term, a(2). 10^2-3=97 is prime, so 2*(10^2-4)=192 is a term, a(4). 10^3-3=997 is prime, so 2*(10^3-4)=1992 is a term, a(5). 10^17-3 is prime, so 2*(10^17-4)=199999999999999992 is a term. 10^140-3 is prime, so 2*(10^140-4) is a term. 10^990-3 is prime, so 2*(10^990-4) is a term. Conjecture: sequence is infinite. - Ray Chandler, Jul 20 2003
Let f(m,n,r,t)=((9).(m).78.(0)(n).21.(9)(m))(r).(9)(t).7 where m, n, r & t are nonnegative integers; dot between numbers means concatenation and "(m)(n)" means number of m's is n. If r*t=0 & p=f(m,n,r,t) is prime then reversal(3*p) = 1.((9)(m).56.(0)(n).43.(9)(m))(r).(9)(t).2 is in the sequence. For example p1=f(0,0,0,0)=7 so reversal(3*p1) = 12 is in the sequence, p2=f(0,0,2,0)=(7821)(2).7=782178217 so reversal(3*p2) = 1.(5643)(2).2 = 1564356432 is in the sequence & p3=f(0,0,674,0) so reversal(3*p3) = 1.(5643)(674).2 is in the sequence. Primes of the form f(m,n,r,t) are a generalized form of primes of the form 10^j-3 that were already related to this sequence by Ray Chandler. For all n, A085331(n) = reversal(A072395(n)). - Farideh Firoozbakht, Jan 08 2005
The list is complete through 2050000000. - Farideh Firoozbakht, Jan 15 2005
a(13) > 10^11. - Donovan Johnson, Feb 03 2012
a(17) > 10^13. - Giovanni Resta, Aug 06 2019

Examples

			phi[{1,21,63,291,2991,6102}] = {1,12,36,192,1992,2016}
		

Crossrefs

Programs

  • Mathematica
    v = {1}; Do[ If[ n == EulerPhi[ FromDigits[ Reverse[ IntegerDigits [ n ] ] ] ], v = Append[ v, n ]; Print[ v ], If[ Mod[ n, 1000000 ] == 0, Print[ -n ] ] ], {n, 2, 2050000000, 2} ] (Firoozbakht)

Extensions

The terms 31067664, 39206496, 1564356432 are from Farideh Firoozbakht, Jan 08 2005
a(10)-a(12) from Donovan Johnson, Feb 03 2012
a(13)-a(16) from Giovanni Resta, Aug 06 2019

A072395 Numbers n such that reverse(phi(n)) = n.

Original entry on oeis.org

1, 21, 63, 291, 2991, 6102, 46676013, 69460293, 2346534651, 6313047393, 23400000651, 80050617822, 234065340651, 234659934651, 2340000000651, 2934000006591
Offset: 1

Views

Author

Joseph L. Pe, Jul 21 2002

Keywords

Comments

For all n, a(n) = reversal(A085331(n)), so see Comment on A085331. This sequence is a subsequence of A069215 and if m is a term of A069215 and 10 doesn't divide m then m is in this sequence. - Farideh Firoozbakht, Jan 09 2005
a(13) > 10^11. - Donovan Johnson, Feb 03 2012
a(17) > 10^13. - Giovanni Resta, Aug 06 2019

Examples

			reverse(phi(6102)) = reverse(2016) = 6102, so 6102 is a term of the sequence.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[10^5], FromDigits[Reverse[IntegerDigits[EulerPhi[#]]]] == # &] (* corrected by Harvey P. Dale, Oct 03 2011 *)

Extensions

More terms from Robert G. Wilson v, Jul 23 2002
More terms from Farideh Firoozbakht, Jan 09 2005
a(10)-a(12) from Donovan Johnson, Feb 03 2012
a(13)-a(16) from Giovanni Resta, Aug 06 2019
Showing 1-3 of 3 results.