A093099 "Fibonacci-digits": start with "11", append sum of first 2 digits to the preceding number, drop first digit.
11, 12, 23, 35, 58, 813, 139, 394, 9412, 41213, 12135, 21353, 13533, 35334, 53348, 33488, 34886, 48867, 886712, 8671216, 67121614, 712161413, 121614138, 216141383, 161413833, 614138337, 141383377, 413833775, 138337755, 383377554, 8337755411, 33775541111
Offset: 1
Examples
a(6): sum of first 2 digits of a(5)=13, append 13 to 58 and get 5813, drop first digit and get 813.
Links
- Robert Israel, Table of n, a(n) for n = 1..3793
Programs
-
Maple
f:= proc(x) local t,q; t:= floor(x/10^(ilog10(x)-1)); t:= (t mod 10) + floor(t/10); t:= t+x*10^(ilog10(t)+1); q:= 10^ilog10(t); t - floor(t/q)*q end proc:x:= 11: R:= x: for n from 2 to 100 do x:= f(x); R:= R,x od:R; # Robert Israel, May 21 2020 # second Maple program: a:= proc(n) option remember; `if`(n=1, 11, (s->parse(cat( s[2..-1], parse(s[1])+parse(s[2]))))(""||(a(n-1)))) end: seq(a(n), n=1..35); # Alois P. Heinz, May 21 2020
-
Mathematica
fd[n_]:=Module[{idn=IntegerDigits[n]},FromDigits[Rest[Join[idn,IntegerDigits[Total[Take[idn,2]]]]]]] NestList[fd,11,30] (* Harvey P. Dale, Mar 06 2011 *)