A064692 Total number of holes in decimal expansion of the number n, assuming 4 has 1 hole.

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

Offset: 0

Author

Matthew Conroy, Oct 11 2001

Keywords

• base
• easy
• nonn

Examples

			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.
		

Links

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

Crossrefs

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

Programs

Mathematica

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

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

Formula

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