cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A102116 Iccanobirt numbers (6 of 15): a(n) = R(a(n-1)) + R(a(n-2)) + a(n-3), where R is the digit reversal function A004086.

This page as a plain text file.
%I A102116 #12 Dec 19 2015 00:28:10
%S A102116 0,0,1,1,2,4,7,13,42,62,63,104,499,1458,9639,18409,101308,903221,
%T A102116 943819,1141966,8512981,9527388,11871383,55668051,62931854,72771964,
%U A102116 148399704,517843422,705114520,398159926,1173206822,3621090124,6895084900
%N A102116 Iccanobirt numbers (6 of 15): a(n) = R(a(n-1)) + R(a(n-2)) + a(n-3), where R is the digit reversal function A004086.
%C A102116 Digit reversal variation of tribonacci numbers A000073.
%C A102116 Inspired by Iccanobif numbers: A001129, A014258-A014260.
%H A102116 Harvey P. Dale, <a href="/A102116/b102116.txt">Table of n, a(n) for n = 0..1000</a>
%F A102116 A004086(a(n)) = A102124(n).
%t A102116 R[n_]:=FromDigits[Reverse[IntegerDigits[n]]];Clear[a];a[0]=0;a[1]=0;a[2]=1;a [n_]:=a[n]=R[a[n-1]]+R[a[n-2]]+a[n-3];Table[a[n], {n, 0, 40}]
%t A102116 nxt[{a_,b_,c_}]:={b,c,FromDigits[Reverse[IntegerDigits[c]]]+ FromDigits[ Reverse[ IntegerDigits[b]]]+a}; Transpose[NestList[nxt,{0,0,1},40]][[1]] (* _Harvey P. Dale_, Oct 10 2014 *)
%Y A102116 Cf. A102111-A102125.
%K A102116 nonn,base,easy
%O A102116 0,5
%A A102116 _Jonathan Vos Post_ and _Ray Chandler_, Dec 30 2004