Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102120
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102120 Iccanobirt numbers (10 of 15): a(n) = R(a(n-1) + R(a(n-2)) + a(n-3)), where R is the digit reversal function A004086. +0
6
0, 0, 1, 1, 2, 4, 7, 31, 24, 44, 711, 977, 8311, 1089, 4023, 53122, 51475, 33677, 412441, 945145, 6303211, 1027527, 8075903, 51363612, 74868455, 376085401, 68539284, 214889742, 927862936, 2360934421, 2982905123, 1968515515, 8282454457 (list; graph; listen)
OFFSET

0,5

COMMENT

Digit reversal variation of Tribonacci numbers A000073.

Inspired by Iccanobif numbers: A001129, A014258-A014260.

FORMULA

a(n) = A004086(A102112(n)).

MATHEMATICA

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}]

CROSSREFS

Cf. A102111-A102125.

Sequence in context: A102118 A102119 A102121 this_sequence A102122 A102123 A102125

Adjacent sequences: A102117 A102118 A102119 this_sequence A102121 A102122 A102123

KEYWORD

nonn,base,easy

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 30 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research