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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124176 Consider the map f that sends n to n + (sum of odd digits of n) - (sum of even digits of n). Sequences gives numbers n such that f^(k))n) = n for some k. 13
0, 11, 13, 17, 18, 25, 28, 54, 55, 64, 65, 112, 121, 134, 137, 143, 148, 155, 156, 165, 166, 173, 178, 184, 187, 198, 200, 209, 211, 216, 231, 233, 234, 237, 244, 245, 270, 275, 280, 285, 314, 336, 341, 358, 363, 385, 396, 402, 407, 410, 413, 429, 431, 432 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Terms computed by Barry and Jongware

LINKS

Eric Angelini (eric.angelini(AT)kntv.be), Dec 04 2006, Table of n, a(n) for n = 1..172

EXAMPLE

11 and 13 loop on themselves, but 12 doesn't:

11 -> 13 -> 17 -> 25 -> 28 -> 18 -> 11

12 -> 11 -> 13 -> 17 -> 25 -> 28 -> 18 -> 11

13 -> 17 -> 25 -> 28 -> 18 -> 11 -> 13

CROSSREFS

Cf. A124177.

Sequence in context: A099481 A205693 A068569 * A031979 A055239 A138708

Adjacent sequences:  A124173 A124174 A124175 * A124177 A124178 A124179

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini (eric.angelini(AT)kntv.be), Dec 04 2006

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 15 03:33 EST 2012. Contains 205694 sequences.