Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147963
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147963 a(n) = number of n-digit numbers not divisible by any of their digits. +0
1
0, 31, 244, 2012, 16831, 142224, 1212521, 10412937, 89964007 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

a[n_] := (c = 0; Do[id = IntegerDigits[i]; Le = Length[id]; pr = Product[If[id[[k]] > 0, Mod[i, id[[k]]], 1], {k, Le}]; If[Mod[i, 10]*pr > 0, (*Print[n]; *)c++ ], {i, 10^(n - 1), 10^n - 1}]; c); a[1] = 0; Table[a[m], {m, 8}]

CROSSREFS

Cf. A038772 Numbers not divisible by any of their digits.

Sequence in context: A082544 A059378 A024003 this_sequence A027846 A042872 A142623

Adjacent sequences: A147960 A147961 A147962 this_sequence A147964 A147965 A147966

KEYWORD

more,nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Nov 17 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research