The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 4

%I

%S 396,406,416,426,436,446,456,466,476,486,496,507,519,533,541,547,559,

%T 573,581,587,599,614,624,634,644,654,664,674,684,694,705,717,731,739,

%U 755,767,781,789,806,820,828,844,856,870,878,894,907,923,935,949,967

%N "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.

%C 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.

%H Eric Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/CommaSum.htm">Comma Sums</a>

%H Eric Angelini, <a href="/A230288/a230288.txt">Comma Sums</a> [Cached copy, with permission]

%o (PARI) A230288_vec([396],200)

%Y Cf. A230288, A230452, A230453.

%K nonn,base

%O 1,1

%A _M. F. Hasler_, Oct 19 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 27 08:22 EDT 2021. Contains 347689 sequences. (Running on oeis4.)