Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102119
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102119 Iccanobirt numbers (9 of 15): a(n) = R(a(n-1) + a(n-2) + R(a(n-3))), where R is the digit reversal function A004086. +0
6
0, 0, 1, 1, 2, 4, 7, 31, 24, 26, 36, 401, 994, 8541, 9369, 90481, 803101, 122309, 918349, 6691411, 1892158, 8837259, 38317811, 15086655, 45813926, 46917727, 407993841, 224348715, 25411507, 629951893, 2286023711, 6507846892, 9250302919 (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(A102111(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]+a[n-2]+R[a[n-3]]]; Table[a[n], {n, 0, 40}]

CROSSREFS

Cf. A102111-A102125.

Sequence in context: A065846 A047904 A102118 this_sequence A102121 A102120 A102122

Adjacent sequences: A102116 A102117 A102118 this_sequence A102120 A102121 A102122

KEYWORD

nonn,base,easy

AUTHOR

Jonathan Vos Post (jvospost2(AT)yahoo.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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research