login
a(n) = a(n-1) + a(n-2) + a(n-3) + R(a(n-4)) where a(0)=a(1)=a(2)=a(3)=1 and R(n) (A004086) is the reverse of n.
1

%I #12 Jun 23 2015 11:22:19

%S 1,1,1,1,4,7,13,25,49,94,199,394,781,1423,3589,6286,11485,24601,52225,

%T 95137,230374,388378,766114,1458025,3085549,6183571,11138812,25616473,

%U 52394659,90903760,190798003,371558074,748909162,1317996148,2739360475,5277120958

%N a(n) = a(n-1) + a(n-2) + a(n-3) + R(a(n-4)) where a(0)=a(1)=a(2)=a(3)=1 and R(n) (A004086) is the reverse of n.

%H Alois P. Heinz, <a href="/A074863/b074863.txt">Table of n, a(n) for n = 0..1000</a>

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%p read transforms; A074863 := proc(n) option remember; local i,j,k,t1; if n <= 3 then 1 else A074863(n-1)+A074863(n-2)+A074863(n-3) +digrev(A074863(n-4)); fi; end;

%Y Cf. A000288.

%K easy,base,nonn

%O 0,5

%A _Felice Russo_, Sep 11 2002

%E Corrected and extended by _David Garber_, Oct 23 2002