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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066449 a(n) = C(n,EulerPhi(n)). 2
1, 2, 3, 6, 5, 15, 7, 70, 84, 210, 11, 495, 13, 3003, 6435, 12870, 17, 18564, 19, 125970, 293930, 646646, 23, 735471, 53130, 9657700, 4686825, 30421755, 29, 5852925, 31, 601080390, 573166440, 2203961430, 417225900, 1251677700, 37, 33578000610 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,300

EXAMPLE

a(6) = C(6,EulerPhi(6)) = C(6,2) = 6!/(2!4!) = 15.

MATHEMATICA

Map[Binomial[#, EulerPhi[#]] &, Range[80]] (* Carl Najafi, Aug 30 2011 *)

PROG

(PARI) { for (n=1, 300, a=binomial(n, eulerphi(n)); write("b066449.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 15 2010]

CROSSREFS

Cf. A000010.

Sequence in context: A100211 A071257 A067392 * A098012 A066117 A156833

Adjacent sequences:  A066446 A066447 A066448 * A066450 A066451 A066452

KEYWORD

easy,nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Dec 28 2001

EXTENSIONS

a(16) - a(38) from Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 15 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 20:03 EST 2012. Contains 205852 sequences.