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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204773 Least k such that k!!*n!! contains every digit at least once. 0
34, 34, 30, 37, 39, 30, 38, 29, 26, 34, 26, 16, 23, 27, 24, 27, 11, 17, 29, 21, 26, 19, 19, 12, 14, 11, 8, 13, 13, 7, 2, 17, 8, 5, 0, 0, 9, 0, 2, 3, 8, 0, 4, 2, 2, 2, 5, 0, 0, 0, 2, 0, 3, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

It is extremely probable that a(n) = 0 for all n >= 58.

LINKS

Table of n, a(n) for n=0..76.

EXAMPLE

a(2) = 30 because 2!!*30!! = 2* 42849873690624000 =  85699747381248000 contains every digit at least once.

MATHEMATICA

Table[k=0; While[!Length[Union[IntegerDigits[k!!*n!]]]==10, k++]; k, {n, 0, 60}]

CROSSREFS

Cf. A006882, A204632, A204633.

Sequence in context: A022990 A023476 A104685 * A291512 A165855 A318148

Adjacent sequences:  A204770 A204771 A204772 * A204774 A204775 A204776

KEYWORD

nonn,base

AUTHOR

Michel Lagneau, Jan 19 2012

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 December 7 20:40 EST 2021. Contains 349589 sequences. (Running on oeis4.)