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. 16
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; text; internal format)
OFFSET

1,2

COMMENTS

Terms computed by Barry and Theunis de Jong.

Subsequence A036301 lists fixed points of the map f = A304439. - M. F. Hasler, May 18 2018

LINKS

Eric Angelini, 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.

PROG

is(n, S=List())=until(setsearch(Set(S), n=A304439(n)), listput(S, n)); n==S[1] \\ M. F. Hasler, May 18 2018

CROSSREFS

Cf. A124177, A036301, A304439; A071648, A071649, A071650.

Sequence in context: A214746 A205693 A068569 * A210757 A031979 A055239

Adjacent sequences:  A124173 A124174 A124175 * A124177 A124178 A124179

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini, Dec 04 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified June 25 10:59 EDT 2018. Contains 311897 sequences. (Running on oeis4.)