|
| |
|
|
A118532
|
|
Start with 1 and repeatedly reverse the digits and add 15 to get the next term.
|
|
3
| |
|
|
1, 16, 76, 82, 43, 49, 109, 916, 634, 451, 169, 976, 694, 511, 130, 46, 79, 112, 226, 637, 751, 172, 286, 697, 811, 133, 346, 658, 871, 193, 406, 619, 931, 154, 466, 679, 991, 214, 427, 739, 952, 274, 487, 799, 1012, 2116, 6127, 7231, 1342, 2446
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| This sequence never cycles.
The plot (see the Noe link) shows 2774 terms of this sequence. It has a regular structure, which continues at higher decades. - T. D. Noe (noe(AT)sspectra.com), May 10 2006
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 1..2774
T. D. Noe, Plot of A118532
N. J. A. Sloane, Sequences of RADD type
|
|
|
FORMULA
| This sequence never cycles. After a while, the pattern of length changes settles into an increasing pattern: 10^(4m)+3, 10^(4m+1)+3, 10^(4m+2)+12, 10^(4m+3)+12, 10^(4(m+1))+3, ... The key is that every two steps adds 15 at each end, unless there is a carry across the middle or a trailing 0. This allows many steps to be carried out in a single operation. - Martin Fuller (martin_n_fuller(AT)btinternet.com), May 12 2006
|
|
|
CROSSREFS
| Cf. A117828, A117816, A117817.
Sequence in context: A189949 A103111 A118862 * A007834 A200873 A082966
Adjacent sequences: A118529 A118530 A118531 * A118533 A118534 A118535
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 06 2006
|
| |
|
|
