The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

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!)
 A181555 a(n) = A002110(n)^n. 14
 1, 2, 36, 27000, 1944810000, 65774855015100000, 733384949590939374729000000, 9037114296609938214167920266348510000000, 78354300210436852307898467208663359164858967744100000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS For n>0, a(n)= first counting number whose prime signature consists of n repeated n times (cf. A002024). Subsequence of A025487. LINKS Amiram Eldar, Table of n, a(n) for n = 0..26 FORMULA a(n) = A079474(2n,n). - Alois P. Heinz, Aug 22 2019 EXAMPLE a(4) = 1944810000 = 210^4 = 2^4 * 3^4 * 5^4 * 7^4. MATHEMATICA a[0] = 1; a[n_] := Product[Prime[i], {i, 1, n}]^n; Array[a, 9, 0] (* Amiram Eldar, Aug 08 2019 *) CROSSREFS A061742(n) = A002110(n)^2. See also A006939, A066120, A166475, A167448. A000005(a(n)) = A000169(n). The divisors of a(n) appear as the first A000169(n) terms of A178479, with A178479(A000169(n)) = a(n). A071207(n, k) gives the number of divisors of n with (n-k) distinct prime factors, A181567(n, k) gives the number of divisors of n with k prime factors counted with multiplicity. Cf. A001221, A001222, A079474, A146290, A146292. Sequence in context: A265944 A127234 A326961 * A306644 A283261 A280420 Adjacent sequences:  A181552 A181553 A181554 * A181556 A181557 A181558 KEYWORD easy,nonn AUTHOR Matthew Vandermast, Oct 31 2010 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.

Last modified December 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://oeis.org/A181555", "fetch_time": 1638903378000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-49/segments/1637964363405.77/warc/CC-MAIN-20211207170825-20211207200825-00580.warc.gz", "warc_record_offset": 68978224, "warc_record_length": 5231, "token_count": 702, "char_count": 2150, "score": 3.6875, "int_score": 4, "crawl": "CC-MAIN-2021-49", "snapshot_type": "longest", "language": "en", "language_score": 0.6785792708396912, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00016-of-00064.parquet"}