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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124177 Consider the map f that sends n to n + (sum of even digits of n) - (sum of odd digits of n). Sequences gives numbers n such that f^(k))n) = n for some k. 13
0, 22, 26, 27, 34, 35, 44, 49, 52, 63, 66, 78, 79, 81, 88, 99, 104, 107, 108, 112, 115, 121, 126, 133, 134, 143, 144, 151, 156, 165, 178, 187, 211, 224, 229, 232, 233, 283, 290, 314, 336, 341, 358, 363, 385, 413, 431, 467, 470, 489, 492, 516, 538, 561, 583, 615 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Terms computed by Jongware

LINKS

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

Eric Angelini, Self-loopers.

EXAMPLE

26 and 27 loop on themselves -- but 28 doesn't.

26 -> 34 -> 35 -> 27 -> 22 -> 26

27 -> 22 -> 26 -> 34 -> 35 -> 27

28 -> 38 -> 43 -> 44 -> 52 -> 49 -> 44

CROSSREFS

Cf. A124176.

Sequence in context: A178423 A108632 A045096 * A160078 A066059 A084891

Adjacent sequences:  A124174 A124175 A124176 * A124178 A124179 A124180

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 23:53 EST 2012. Contains 205860 sequences.