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.

A074858 a(n) = a(n-1) + a(n-2) + R(a(n-3)) where a(0) = a(1) = a(2) = 1 and R(n) (A004086) means the reverse of n.

Original entry on oeis.org

1, 1, 1, 3, 5, 9, 17, 31, 57, 159, 229, 463, 1643, 3028, 5035, 11524, 24762, 41591, 108864, 177197, 305575, 951573, 2048919, 3575995, 6000073, 18774470, 30770296, 53244772, 91462849, 213915324, 333122408, 641864151, 1398505871, 2844591355
Offset: 0

Views

Author

Felice Russo, Sep 11 2002

Keywords

Examples

			a(9) = 57 + 31 + R(17) = 57 + 31 + 71 = 159.
		

Crossrefs

Cf. A000213.

Programs

  • Maple
    R:=proc(n) local nn, nnn: nn:=convert(n,base,10): add(nn[nops(nn)+1-j]*10^(j-1),j=1..nops(nn)) end: a[0]:=1: a[1]:=1: a[2]:=1: for n from 3 to 34 do a[n]:=a[n-1]+a[n-2]+R(a[n-3]) od: seq(a[n],n=0..34); # Emeric Deutsch, Jul 25 2005
  • Mathematica
    RecurrenceTable[{a[0]==a[1]==a[2]==1,a[n]==a[n-1]+a[n-2]+IntegerReverse[ a[n-3]]},a,{n,40}] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Apr 05 2020 *)

Extensions

More terms from Emeric Deutsch, Jul 25 2005