cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A243259 Numbers n such that n appears in the sequence x(i) = x(i-1) +/- digitsum(x(i-1)), where even digitsums are added, odd digitsums are subtracted and x(0) = n.

Original entry on oeis.org

99, 108, 117, 198, 207, 216, 297, 306, 315, 396, 405, 414, 495, 504, 513, 594, 603, 612, 693, 702, 711, 792, 801, 810, 972, 990, 999, 1008, 1098, 1107, 1116, 1197, 1206, 1215, 1296, 1305, 1314, 1395, 1404, 1413, 1494, 1503, 1512, 1593, 1602, 1611, 1692, 1701
Offset: 1

Views

Author

Anthony Sand, Jun 02 2014

Keywords

Comments

The sequence begins with x(0) = n and continues by adding or subtracting the digitsum. When the digitsum(x(i-1)) is even, x(i) = x(i-1) + digitsum(x(i-1)), otherwise x(i) = x(i-1) - digitsum(x(i-1)).

Examples

			digitsum(99) = 18, 18 is even, so 99 + 18 = 117. digitsum(117) = 9, 9 is odd, so 177 - 9 = 108. 108 - 9 = 99, hence 99 belongs to sequence.
108 - 9 = 99, 99 + 18 = 117, 117 - 9 = 108, hence 108 is in the sequence.
117 - 9 = 108. 108 - 9 = 99. 99 + 18 = 117.
198 + 18 = 216. 216 - 9 = 207. 207 - 9 = 198.
		

Crossrefs

Formula

x(i) = x(i-1) + digitsum(x(i-1)) * (1 - (digitsum(x(i-1)) mod 2) * 2).
Showing 1-1 of 1 results.