id:A102113 - OEIS Search Results

Search: id:A102113

Displaying 1-1 of 1 results found.

page 1

Iccanobirt numbers (3 of 15): a(n) = a(n-1) + R(a(n-2)) + R(a(n-3)), where R is the digit reversal function A004086.

+0
6

0, 0, 1, 1, 2, 4, 7, 13, 24, 62, 135, 203, 760, 1593, 1962, 5980, 12622, 16208, 39724, 142606, 265660, 914694, 1587497, 2150478, 10594748, 27283111, 120773124, 216660897, 649176190, 1868619823, 2758358381, 6139199008, 11266906261 (list; graph; listen)

	OFFSET	`0,5`
	COMMENT	`Digit reversal variation of Tribonacci numbers A000073.` `Inspired by Iccanobif numbers: A001129, A014258-A014260.`
	FORMULA	`A004086(a(n)) = A102121(n).`
	MATHEMATICA	`R[n_]:=FromDigits[Reverse[IntegerDigits[n]]]; Clear[a]; a[0]=0; a[1]=0; a[2]=1; a [n_]:=a[n]=a[n-1]+R[a[n-2]]+R[a[n-3]]; Table[a[n], {n, 0, 40}]`
	CROSSREFS	`Cf. A102111-A102125.` `Sequence in context: A127602 A113291 A102112 this_sequence A034440 A000074 A079958` `Adjacent sequences: A102110 A102111 A102112 this_sequence A102114 A102115 A102116`
	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

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research