login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033372 [ 52/n ]. 1
52, 26, 17, 13, 10, 8, 7, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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

1,1

COMMENTS

Number of cards each person receives when 52 cards are dealt evenly to n people. - Rick L. Shepherd, Jun 17 2005

LINKS

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

FORMULA

a(n) = floor(52/n) = (52-A050514(n))/n. - Rick L. Shepherd, Jun 17 2005

MATHEMATICA

Floor[52/Range[100]] (* Harvey P. Dale, May 11 2012 *)

PROG

(PARI) a(n) = floor(52/n) a(n) = 52\n (Shepherd)

CROSSREFS

Cf. A050514 (mod(52, n): cards left over after dealing 52 evenly to n people).

Sequence in context: A298573 A048365 A317416 * A126767 A143723 A252713

Adjacent sequences:  A033369 A033370 A033371 * A033373 A033374 A033375

KEYWORD

easy,nonn

AUTHOR

Jeff Burch

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 11 07:38 EST 2019. Contains 329914 sequences. (Running on oeis4.)