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!)
A124177 Consider the map f that sends m to m + (sum of even digits of m) - (sum of odd digits of m). Sequence gives numbers m such that f^(k)(m) = m for some k. 16

%I #26 Jun 18 2021 23:02:16

%S 0,22,26,27,34,35,44,49,52,63,66,78,79,81,88,99,104,107,108,112,115,

%T 121,126,133,134,143,144,151,156,165,178,187,211,224,229,232,233,283,

%U 290,314,336,341,358,363,385,413,431,467,470,489,492,516,538,561,583,615

%N Consider the map f that sends m to m + (sum of even digits of m) - (sum of odd digits of m). Sequence gives numbers m such that f^(k)(m) = m for some k.

%C Terms computed by Theunis de Jong.

%C Subsequence A036301 lists fixed points of the map f = A304440. - _M. F. Hasler_, May 18 2018

%H Eric Angelini, <a href="/A124177/b124177.txt">Table of n, a(n) for n = 1..182</a>

%H Eric Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/22.htm">Self-loopers</a>.

%e 26 and 27 loop on themselves, but 28 doesn't.

%e 26 -> 34 -> 35 -> 27 -> 22 -> 26

%e 27 -> 22 -> 26 -> 34 -> 35 -> 27

%e 28 -> 38 -> 43 -> 44 -> 52 -> 49 -> 44.

%o (PARI) is(n,S=List())={until(setsearch(Set(S),n=A304440(n)),listput(S,n));n==S[1]} \\ _M. F. Hasler_, May 18 2018

%Y Cf. A124176, A036301, A304439, A304440, A071650, A071648, A071649.

%K base,easy,nonn

%O 1,2

%A _Eric Angelini_, Dec 04 2006

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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)