Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063917
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063917 Smallest k such that k!!! is a multiple of n. +0
1
1, 2, 3, 4, 5, 6, 7, 8, 6, 5, 11, 12, 13, 7, 15, 8, 17, 6, 19, 10 (list; graph; listen)
OFFSET

0,2

COMMENT

Also called Smarandache triple factorials.

REFERENCES

F. Smarandache, "Some problems in number theory", Student Conference, University of Craiova, Department of Mathematics, 1979.

LINKS

Anonymous, Smarandache k-factorial

EXAMPLE

a(16)=8 because 8!!!=8x(8-3)x(8-6)=8x5x2 which is divisible by 16 and 8 is the smallest integer with this property.

CROSSREFS

Sequence in context: A043268 A160597 A097377 this_sequence A073795 A017893 A017883

Adjacent sequences: A063914 A063915 A063916 this_sequence A063918 A063919 A063920

KEYWORD

nonn

AUTHOR

Mike Antholy (mikeantholy(AT)yahoo.ca), Aug 31 2001

page 1

Search completed in 0.006 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 13:47 EST 2009. Contains 167481 sequences.


AT&T Labs Research