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.

A161598 Numbers such that TITO(n) is not equal to n, where TITO(n) = A161594(n).

Original entry on oeis.org

10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 32, 34, 35, 36, 38, 40, 42, 45, 48, 49, 50, 51, 52, 54, 56, 57, 58, 60, 63, 64, 65, 68, 70, 72, 74, 75, 76, 78, 80, 81, 84, 85, 87, 90, 91, 92, 94, 95, 96, 98, 100, 102, 104, 105, 106, 108, 110, 111, 112, 114, 115, 116
Offset: 1

Views

Author

J. H. Conway & Tanya Khovanova, Jun 14 2009

Keywords

Comments

There are no prime numbers in the sequence: A010051(a(n)) = 0.

Crossrefs

Complement of A161597.

Programs

  • Haskell
    a161598 n = a161598_list !! (n-1)
    a161598_list = filter (\x -> a161594 x /= x) [1..]
    -- Reinhard Zumkeller, Oct 14 2011
  • Mathematica
    reversepower[{n_, k_}] := FromDigits[Reverse[IntegerDigits[n]]]^k f[n_] := FromDigits[ Reverse[IntegerDigits[Times @@ Map[reversepower, FactorInteger[n]]]]] Select[Range[200], f[ # ] != # &]

Extensions

Edited by N. J. A. Sloane, Jun 23 2009
Offset corrected by Reinhard Zumkeller, Oct 14 2011