id:A092368 - OEIS Search Results

Search: id:A092368

Displaying 1-1 of 1 results found.

page 1

a(0)=0, a(1)=1, a(2)=1. For n>2, let R_{k}(n) = the digit reversal of n in base k (R_{k}(n) is written in base 10). a(n) is the smallest value of R_{k}(n) arising if k=2,..,n-1.

+0
1

0, 1, 1, 3, 1, 5, 2, 5, 1, 1, 2, 7, 2, 7, 2, 3, 1, 10, 2, 9, 2, 3, 2, 13, 2, 1, 2, 1, 2, 11, 2, 11, 1, 3, 2, 5, 1, 13, 2, 3, 2, 13, 2, 13, 2, 3, 2, 23, 2, 1, 2, 3, 2, 17, 2, 5, 2, 3, 2, 31, 2, 16, 2, 3, 1, 5, 2, 17, 2, 3, 2, 17, 2, 17, 2, 3, 2, 7, 2, 19, 2, 1, 2, 38, 2, 5, 2, 3, 2, 19, 2, 7, 2, 3, 2, 5 (list; graph; listen)

	OFFSET	`0,4`
	CROSSREFS	`Cf. A004086, A030101-A030108, A056960-A056963.` `Sequence in context: A134033 A095026 A094367 this_sequence A066249 A065168 A065277` `Adjacent sequences: A092365 A092366 A092367 this_sequence A092369 A092370 A092371`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (pcmusume(AT)m11.alpha-net.ne.jp), Mar 19 2004`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.

AT&T Labs Research