id:A045888 - OEIS Search Results

Search: id:A045888

Displaying 1-1 of 1 results found.

page 1

Number of distinct odd numbers visible as proper substrings of n.

+0
1

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

	OFFSET	`1,13`
	EXAMPLE	`The first nonzero entry is a(10)=1 since we can see 1 as a proper substring of 10; a(132)=3 because we can see 1,3,13.`
	CROSSREFS	`Sequence in context: A107450 A069349 A062754 this_sequence A107279 A078461 A111621` `Adjacent sequences: A045885 A045886 A045887 this_sequence A045889 A045890 A045891`
	KEYWORD	`base,easy,nonn,nice`
	AUTHOR	`Felice Russo (felice.russo(AT)katamail.com)`
	EXTENSIONS	`More terms from Larry Reeves (larryr(AT)acm.org), Sep 28 2000`

page 1

Search completed in 0.002 seconds

Last modified July 8 18:40 EDT 2008. Contains 141013 sequences.

AT&T Labs Research