|
| |
|
|
A045888
|
|
Number of distinct odd numbers visible as proper substrings of n.
|
|
3
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,13
|
|
|
COMMENTS
| a(A164766(n))=n and a(m)<>n for m < A164766(n); a(A014263(n))=0. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 25 2009]
|
|
|
LINKS
| R. Zumkeller, Table of n, a(n) for n = 1..20000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 25 2009]
|
|
|
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.
|
|
|
PROG
| (Haskell)
import Data.List (isInfixOf)
a045888 n = length $ filter (`isInfixOf` (show n)) $ map show [1, 3..n-1]
-- Reinhard Zumkeller, Jul 19 2011
|
|
|
CROSSREFS
| Sequence in context: A069349 A167404 A062754 * A107279 A078461 A111621
Adjacent sequences: A045885 A045886 A045887 * A045889 A045890 A045891
|
|
|
KEYWORD
| base,easy,nonn,nice
|
|
|
AUTHOR
| Felice Russo (frusso(AT)micron.com)
|
|
|
EXTENSIONS
| More terms from Larry Reeves (larryr(AT)acm.org), Sep 28 2000
|
| |
|
|
