id:A095827 - OEIS Search Results

Search: id:A095827

Displaying 1-1 of 1 results found.

page 1

a(n) is the smallest k such that ((A007953)^k)(9n)=9.

+0
1

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2 (list; graph; listen)

	OFFSET	`1,11`
	COMMENT	`The first occurrence of a 3 is a(11111111111).`
	CROSSREFS	`Sequence in context: A043283 A127937 A083911 this_sequence A091887 A144871 A066799` `Adjacent sequences: A095824 A095825 A095826 this_sequence A095828 A095829 A095830`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Paul Boddington (psb(AT)maths.warwick.ac.uk), Jul 10 2004`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research