Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124176
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A124176
%S A124176 0,11,13,17,18,25,28,54,55,64,65,112,121,134,137,143,148,155,156,165,
%T A124176 166,173,178,184,187,198,200,209,211,216,231,233,234,237,244,245,270,
%U A124176 275,280,285,314,336,341,358,363,385,396,402,407,410,413,429,431,432
%N 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.
%C A124176 Terms computed by Barry and Jongware
%H A124176 Eric Angelini (eric.angelini(AT)kntv.be), Dec 04 2006, <a href="b124176.txt">
               Table of n, a(n) for n = 1..172</a>
%e A124176 11 and 13 loop on themselves, but 12 doesn't:
%e A124176 11 -> 13 -> 17 -> 25 -> 28 -> 18 -> 11
%e A124176 12 -> 11 -> 13 -> 17 -> 25 -> 28 -> 18 -> 11
%e A124176 13 -> 17 -> 25 -> 28 -> 18 -> 11 -> 13
%Y A124176 Cf. A124177.
%Y A124176 Sequence in context: A049722 A099481 A068569 this_sequence A031979 A055239 
               A138708
%Y A124176 Adjacent sequences: A124173 A124174 A124175 this_sequence A124177 A124178 
               A124179
%K A124176 base,easy,nonn
%O A124176 1,2
%A A124176 Eric Angelini (eric.angelini(AT)kntv.be), Dec 04 2006

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research