login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064692 Total number of holes in decimal expansion of the number n, assuming 4 has 1 hole. 6
1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 3, 2, 2, 2, 3, 2, 3, 2, 4, 3, 2, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 1, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

LINKS

Indranil Ghosh, Table of n, a(n) for n = 0..50000

FORMULA

a(A001742(n)) = 0. - Michel Marcus, Jul 25 2015

EXAMPLE

We assume decimal digits 1,2,3,5,7 have no hole; 0,4,6,9 have one hole each; 8 has two holes. So a(148)=3.

MATHEMATICA

Table[DigitCount[x].{0, 0, 0, 1, 0, 1, 0, 2, 1, 1}, {x, 0, 104}] (* Zak Seidov, Jul 25 2015 *)

PROG

(Python)

def A064692(n):

....x=str(n)

....return x.count("0")+x.count("4")+x.count("6")+x.count("8")*2+x.count("9") # Indranil Ghosh, Feb 02 2017

CROSSREFS

Cf. A001742, A064532, A064693, A206439, A064692, A208568.

Sequence in context: A269241 A086013 A167687 * A286106 A079677 A286564

Adjacent sequences:  A064689 A064690 A064691 * A064693 A064694 A064695

KEYWORD

base,easy,nonn

AUTHOR

Matthew Conroy, Oct 11 2001

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 June 16 15:38 EDT 2019. Contains 324153 sequences. (Running on oeis4.)