Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069468
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069468 Number of ways writing n! as a product of some other numbers which has no digits equal to 1. +0
1
0, 1, 3, 17, 68, 807, 5310, 121536, 2775630, 48782385, 0, 0, 0, 0, 0 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n)=A067734(n!)=A067734(A000142(n))

EXAMPLE

n=4, 4!=24, A067734(24)=17 and the 17 solutions are as follows: {38,46,64,83,226,234,243,262,324,342,423,432,622,2223,2232,2322,3222}. a(n)=0 if n>10 since A068184 and A067185 are finite and full sequences.

CROSSREFS

Cf. A067734, A000142, A068183, A068185.

Sequence in context: A061982 A101562 A034566 this_sequence A128948 A049181 A100233

Adjacent sequences: A069465 A069466 A069467 this_sequence A069469 A069470 A069471

KEYWORD

base,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 25 2002

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research