Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129893
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129893 a(n) = s!/(s-n)! where s = (n*(n+1)/2)+1. +0
2
1, 2, 12, 210, 7920, 524160, 53721360, 7866331200, 1556675366400, 399790821830400, 129210868410624000, 51295616536721356800, 24529502681864788608000, 13903600293770901182464000 (list; graph; listen)
OFFSET

0,2

COMMENT

Bread Shop Open!. We have a loaf of bread which has a kernel of corns irregularly inside. We cut the loaf n times getting the maximal number (s, see A000124) of pieces and distribute one piece to each of n people. The remaining pieces of bread will be the prize for the winner. The sequence gives the number of cases when n pieces are distributed to n persons.

REFERENCES

A. Burstein and T. Mansour, Words restricted by 3-letter ..., Annals. Combin., 7 (2003), 1-14; see Example 3.5.

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 72, Problem 2.

H. E. Dudeney, Amusements in Mathematics, Nelson, London, 1917, page 177.

L. Hogben, Choice and Chance by Cardpack and Chessboard. Vol. 1, Chanticleer Press, NY, 1950, p. 22.

Clark Kimberling, Complementary Equations, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.4.

D. A. Lind, On a class of nonlinear binomial sums, Fib. Quart., 3 (1965), 292-298.

D. J. Price, Some unusual series occurring in n-dimensional geometry, Math. Gaz., 30 (1946), 149-150.

N. Reading, On the structure of Bruhat Order, Ph.D. dissertation, University of Minnesota, anticipated 2002.

N. Reading, Order Dimension, Strong Bruhat Order and Lattice Properties for Posets, Order, Vol. 19, no. 1 (2002), 73-100.

A. M. Robert, A Course in p-adic Analysis, Springer-Verlag, 2000; p. 213.

R. Simion and F.W. Schmidt, Restricted Permutations, Europ. J. Comb., 6, 1985, 383-406.

N. J. A. Sloane, On single-deletion-correcting codes, in Codes and Designs (Columbus, OH, 2000), 273-291, Ohio State Univ. Math. Res. Inst. Publ., 10, de Gruyter, Berlin, 2002.

W. A. Whitworth, DCC Exercises in Choice and Chance, Stechert, NY, 1945, p. 30.

A. M. Yaglom and I. M. Yaglom: Challenging Mathematical Problems with Elementary Solutions. Vol. I. Combinatorial Analysis and Probability Theory. New York: Dover Publications, Inc., 1987, p. 13, #44 (First published: San Francisco: Holden-Day, Inc., 1964)

LINKS

Go jae Song, Perfect Numbers.

FORMULA

a(n)=sPn, where s=(n*(n+1)/2)+1

EXAMPLE

a(2)=12 s=4,n=2 because we can write 12=4*3.

a(3)=210 s=7,n=3 because we can write 210=7*6*5.

CROSSREFS

Cf. A000124, A107868, A129933.

Sequence in context: A094157 A012598 A156489 this_sequence A008352 A082491 A153302

Adjacent sequences: A129890 A129891 A129892 this_sequence A129894 A129895 A129896

KEYWORD

nonn,nice

AUTHOR

Kim Dong Seok (Go Jae Song, Nam Dae Young) from KNU (gjs0419(AT)nate.com), Jun 04 2007

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 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research