login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET

1,13

COMMENTS

a(A164766(n)) = n and a(m) <> n for m < A164766(n); a(A014263(n)) = 0. - Reinhard Zumkeller, Aug 25 2009

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..20000

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: A167404 A280223 A062754 * A335885 A335875 A107279

Adjacent sequences:  A045885 A045886 A045887 * A045889 A045890 A045891

KEYWORD

base,easy,nonn,nice

AUTHOR

Felice Russo

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Sep 28 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 6 10:01 EDT 2020. Contains 336245 sequences. (Running on oeis4.)