|
%I #10 Jan 15 2022 04:32:21
%S 1,11,21,23,44,76,21,79,1,8,9,71,8,97,501,895,6931,6287,81231,81578,
%T 908261,938989,527481,746641,2214721,2631692,3146484,6718775,9525689,
%U 46444261,5996955,61214425,8311276,10752596,27836091,78688583
%N Reversed sum of the two previous terms, with a(1) = 1 and a(2) = 11.
%C Given two initial terms, sum the terms and reverse the digits of the sum. Then repeat.
%C Related to A014258, the Iccanobif numbers, but with initial terms 1 and 11 rather than 0 and 1.
%t Clear[ BiF ]; BiF[ 0 ]=1; BiF[ 1 ]=11; BiF[ n_Integer ] := BiF[ n ]=Plus@@(IntegerDigits[ BiF[ n-2 ]+BiF[ n-1 ], 10 ]//(#*Array[ 10^#&, Length[ # ], 0 ])&); Array[ BiF, 40, 0 ]
%t nxt[{a_, b_}]:={b, FromDigits[Reverse[IntegerDigits[a+b]]]}; Transpose[ NestList[ nxt, {0, 1}, 40]][[1]]
%o (Python)
%o terms = [1, 11]
%o for i in range(100):
%o terms.append(int(str(terms[-1]+terms[-2])[::-1]))
%o print(terms) # _Gleb Ivanov_, Jan 14 2022
%Y Cf. A014258 but with initial terms 1 and 11 rather than 0 and 1.
%K nonn,base,easy
%O 1,2
%A _Tim Ricchuiti_, Jan 14 2022
|
