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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072392 Numbers n such that reverse(n) = phi(n) (mod n). 0
21, 27, 37, 63, 270, 291, 397, 1545, 1853, 2991, 6102, 15503, 27036, 48776 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

reverse(48776) = 67784 = 19008 (mod 48776) and 19008 = phi(48776), so 48776 is a term of the sequence.

MATHEMATICA

Select[Range[10^5], Mod[ FromDigits[Reverse[IntegerDigits[n]]], # ] == EulerPhi[ # ] &]

CROSSREFS

Sequence in context: A064507 A103246 A206347 * A144415 A098898 A098768

Adjacent sequences:  A072389 A072390 A072391 * A072393 A072394 A072395

KEYWORD

base,nonn

AUTHOR

Joseph L. Pe (JosephL.Pe(AT)hotmail.com), Jul 21 2002

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 16 17:48 EST 2012. Contains 205939 sequences.