A230450 "Comma sum" sequence: a(n+1)-a(n) = rightmost digit of a(n) + leftmost digit of a(n+1), use smallest possible solution; starting with 396.

396, 406, 416, 426, 436, 446, 456, 466, 476, 486, 496, 507, 519, 533, 541, 547, 559, 573, 581, 587, 599, 614, 624, 634, 644, 654, 664, 674, 684, 694, 705, 717, 731, 739, 755, 767, 781, 789, 806, 820, 828, 844, 856, 870, 878, 894, 907, 923, 935, 949, 967

Offset

1,1

Comments

The starting value 396 is the first which seems to lead to an infinite sequence; most smaller starting values "converge" to a sequence ending in 989, which has no successor. See A230288 for further discussion.

Links

Michael S. Branicky, Table of n, a(n) for n = 1..10000

Eric Angelini, Comma Sums

Eric Angelini, Comma Sums [Cached copy, with permission]

Prog

(PARI) A230288_vec([396], 200)
(Python) # uses A230288gen() in A230288
from itertools import islice
print(list(islice(A230288gen(start=[396]), 123))) # Michael S. Branicky, Nov 03 2024

Crossrefs

Cf. A230288, A230452, A230453.

Sequence in context: A278605 A278269 A278606 * A247989 A126078 A275171

Adjacent sequences: A230447 A230448 A230449 * A230451 A230452 A230453

Keyword

nonn,base

Author

M. F. Hasler, Oct 19 2013

Status

approved