Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072392
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072392 Numbers n such that reverse(n) = phi(n) (mod n). +0
1
21, 27, 37, 63, 270, 291, 397, 1545, 1853, 2991, 6102, 15503, 27036, 48776 (list; graph; listen)
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: A134935 A064507 A103246 this_sequence A098898 A098768 A114168

Adjacent sequences: A072389 A072390 A072391 this_sequence A072393 A072394 A072395

KEYWORD

base,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research