id:A124177 - OEIS Search Results

Search: id:A124177

Displaying 1-1 of 1 results found.

page 1

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.

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

	OFFSET	`1,2`
	COMMENT	`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: A070809 A108632 A045096 this_sequence A160078 A066059 A084891` `Adjacent sequences: A124174 A124175 A124176 this_sequence A124178 A124179 A124180`
	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 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research