The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A074863 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
 1, 1, 1, 1, 4, 7, 13, 25, 49, 94, 199, 394, 781, 1423, 3589, 6286, 11485, 24601, 52225, 95137, 230374, 388378, 766114, 1458025, 3085549, 6183571, 11138812, 25616473, 52394659, 90903760, 190798003, 371558074, 748909162, 1317996148, 2739360475, 5277120958 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1000 N. J. A. Sloane, Transforms MAPLE 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; CROSSREFS Cf. A000288. Sequence in context: A248098 A229439 A000288 * A118334 A205538 A181565 Adjacent sequences: A074860 A074861 A074862 * A074864 A074865 A074866 KEYWORD easy,base,nonn AUTHOR Felice Russo, Sep 11 2002 EXTENSIONS Corrected and extended by David Garber, Oct 23 2002 STATUS approved

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 March 24 06:25 EDT 2023. Contains 361454 sequences. (Running on oeis4.)