id:A061295 - OEIS Search Results

Search: id:A061295

Displaying 1-1 of 1 results found.

page 1

Minimal number of steps to get from 0 to n by (a) adding 1 or (b) subtracting 1 or (c) multiplying by 3.

+0
1

0, 1, 2, 2, 3, 4, 3, 4, 4, 3, 4, 5, 4, 5, 6, 5, 6, 5, 4, 5, 6, 5, 6, 6, 5, 6, 5, 4, 5, 6, 5, 6, 7, 6, 7, 6, 5, 6, 7, 6, 7, 8, 7, 8, 7, 6, 7, 8, 7, 8, 7, 6, 7, 6, 5, 6, 7, 6, 7, 8, 7, 8, 7, 6, 7, 8, 7, 8, 8, 7, 8, 7, 6, 7, 8, 7, 8, 7, 6, 7, 6, 5, 6, 7, 6, 7, 8, 7, 8, 7, 6, 7, 8, 7, 8, 9, 8, 9, 8, 7, 8, 9, 8, 9, 8 (list; graph; listen)

	OFFSET	`0,3`
	FORMULA	`a(3n)=a(n)+1; a(3n+1)=a(n)+2; a(3n+2)=a(n+1)+2; a(0)=0, a(1)=1, a(2)=2.`
	EXAMPLE	`a(20)=6 since 20=(0+1+1)33+1+1=((0+1+1)3+1)3-1`
	CROSSREFS	`Cf. A056792.` `Adjacent sequences: A061292 A061293 A061294 this_sequence A061296 A061297 A061298` `Sequence in context: A003078 A002308 A056796 this_sequence A081742 A127432 A135529`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 06 2001`

page 1

Search completed in 0.002 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research