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!)
A018268 Divisors of 66. 0
1, 2, 3, 6, 11, 22, 33, 66 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

There are only three ways to partition 66 into its distinct divisors (see A033630), specifically: 33 + 22 + 6 + 3 + 2 = 33 + 22 + 11 = 66. - Alonso del Arte, Nov 06 2017

LINKS

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

Index entries for sequences related to divisors of numbers

MATHEMATICA

Divisors[66] (* Alonso del Arte, Nov 06 2017 *)

PROG

(PARI) divisors(66) \\ Charles R Greathouse IV, Jun 22 2017

CROSSREFS

Sequence in context: A329667 A026742 A316471 * A082616 A018613 A036589

Adjacent sequences:  A018265 A018266 A018267 * A018269 A018270 A018271

KEYWORD

nonn,fini,full,easy

AUTHOR

N. J. A. Sloane.

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 November 30 06:28 EST 2021. Contains 349419 sequences. (Running on oeis4.)