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!)
A178960 Numbers n such that n! contains every digit at least once. 1
23, 27, 31, 33, 34, 35, 36, 37, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..70.

EXAMPLE

23 is in the sequence because 23! = 25852016738884976640000 contains every

  digit at least once.

MAPLE

with(numtheory):Digits:=200:B:={0, 1, 2, 3, 4, 5, 6, 7, 8, 9}: T:=array(1..250) : for

  p from 1 to 200 do:ind:=0:n:=p!:l:=length(n):n0:=n:s:=0:for m from 1 to l do:q:=n0:u:=irem(q, 10):v:=iquo(q, 10):n0:=v : T[m]:=u:od: A:=convert(T, set):z:=nops(A):if A intersect B = B and ind=0 then ind:=1: printf(`%d, `, p):else fi:od:

MATHEMATICA

Select[Range[101], Length[Union[IntegerDigits[#!]]] == 10 &]

PROG

(MAGMA) [n: n in [0..101] | Seqset(Intseq(Factorial(n))) eq {0..9}];  // Bruno Berselli, May 17 2011

CROSSREFS

Cf. A178929 A054038 A156977 A054038 A074205 A020666

Sequence in context: A163142 A038772 A188454 * A282713 A272761 A070774

Adjacent sequences:  A178957 A178958 A178959 * A178961 A178962 A178963

KEYWORD

nonn,base

AUTHOR

Michel Lagneau, Dec 31 2010

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 May 27 12:01 EDT 2020. Contains 334657 sequences. (Running on oeis4.)