id:A124176 - OEIS Search Results

Search: id:A124176

Displaying 1-1 of 1 results found.

page 1

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.

+0
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; listen)

	OFFSET	`1,2`
	COMMENT	`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: A049722 A099481 A068569 this_sequence A031979 A055239 A138708` `Adjacent sequences: A124173 A124174 A124175 this_sequence A124177 A124178 A124179`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Eric Angelini (eric.angelini(AT)kntv.be), Dec 04 2006`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research