login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161597 Numbers such that TITO(n) = n, where TITO(n) = A161594(n). 9

%I #20 May 11 2015 21:58:53

%S 1,2,3,4,5,6,7,8,9,11,13,17,19,22,23,26,29,31,33,37,39,41,43,44,46,47,

%T 53,55,59,61,62,66,67,69,71,73,77,79,82,83,86,88,89,93,97,99,101,103,

%U 107,109,113,121,127,131,137,139,143,149,151,157,163,167,169,173,179

%N Numbers such that TITO(n) = n, where TITO(n) = A161594(n).

%C TITO(p) = p, for any prime p.

%H Reinhard Zumkeller, <a href="/A161597/b161597.txt">Table of n, a(n) for n = 1..10000</a>

%H T. Khovanova, <a href="http://blog.tanyakhovanova.com/?p=144">Turning Numbers Inside Out</a> [From _Tanya Khovanova_, Jul 07 2009]

%t reversepower[{n_, k_}] := FromDigits[Reverse[IntegerDigits[n]]]^k f[n_] := FromDigits[ Reverse[IntegerDigits[Times @@ Map[reversepower, FactorInteger[n]]]]] Select[Range[200], f[ # ] == # &]

%o (Haskell)

%o a161597 n = a161597_list !! (n-1)

%o a161597_list = filter (\x -> a161594 x == x) [1..]

%o -- _Reinhard Zumkeller_, Oct 14 2011

%o (PARI) is(n)={n==A161594(n)} \\ _M. F. Hasler_, May 11 2015

%Y Complement of A161598; nonprimes: A161600.

%K nonn,base

%O 1,2

%A _J. H. Conway_ & _Tanya Khovanova_, Jun 14 2009

%E Edited by _N. J. A. Sloane_, Jun 23 2009

%E Offset corrected by _Reinhard Zumkeller_, Oct 14 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 06:52 EDT 2024. Contains 371920 sequences. (Running on oeis4.)