The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A300999 Add to a(n) the first digit of a(n+1) to get a(n+2), with a(1) = 1 and a(2) = 2. 1

%I

%S 1,2,3,5,8,13,9,22,11,23,13,24,15,25,17,26,19,27,21,29,23,31,26,33,29,

%T 35,32,38,35,41,39,44,43,48,47,52,52,57,57,62,63,68,69,74,76,81,84,89,

%U 92,98,101,99,110,100,111,101,112,102,113,103,114,104,115,105,116,106,117,107,118,108,119

%N Add to a(n) the first digit of a(n+1) to get a(n+2), with a(1) = 1 and a(2) = 2.

%C The sequence, starting with a(1) = 1 and a(2) = 2, never enters into a loop.

%H Jean-Marc Falcoz, <a href="/A300999/b300999.txt">Table of n, a(n) for n = 1..10002</a>

%e a(1) + first digit of a(2) = 1 + 2 = a(3) = 3,

%e a(2) + first digit of a(3) = 2 + 3 = a(4) = 5,

%e a(3) + first digit of a(4) = 3 + 5 = a(5) = 8,

%e a(4) + first digit of a(5) = 5 + 8 = a(6) = 13,

%e a(5) + first digit of a(6) = 8 + 1 = a(7) = 9,

%e a(6) + first digit of a(7) = 13 + 9 = a(8) = 22,

%e a(7) + first digit of a(8) = 9 + 2 = a(9) = 11,

%e etc.

%o (PARI) a=vector(10^4); a=1; a=2; for(n=3, #a, a[n]=digits(a[n-1])+a[n-2]); a \\ _Altug Alkan_, Mar 20 2018

%Y Cf. A267809.

%K nonn,base,easy

%O 1,2

%A _Eric Angelini_ and _Jean-Marc Falcoz_, Mar 20 2018

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

Last modified May 25 13:19 EDT 2022. Contains 354071 sequences. (Running on oeis4.)