cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A117927 a(n) = binomial(s(n), n) where s(n) = n-th semiprime.

This page as a plain text file.
%I A117927 #13 Jul 15 2022 10:35:15
%S A117927 4,15,84,210,2002,5005,116280,319770,2042975,5311735,193536720,
%T A117927 548354040,1476337800,9669554100,25140840660,991493848554,
%U A117927 6499270398159,27900908274925,280576272201225,1210269541711230,3342649210440540,34315056105966195,227068876035237600,2305629203680278840
%N A117927 a(n) = binomial(s(n), n) where s(n) = n-th semiprime.
%C A117927 Semiprime analog of A060604.
%H A117927 Harvey P. Dale, <a href="/A117927/b117927.txt">Table of n, a(n) for n = 1..1000</a>
%F A117927 a(n) = binomial(A001358(n), n).
%e A117927 a(1) = binomial(4,1) = 4.
%e A117927 a(2) = binomial(6,2) = 15.
%e A117927 a(3) = binomial(9,3) = 84.
%e A117927 a(4) = binomial(10,4) = 210.
%e A117927 a(5) = binomial(14,5) = 2002.
%e A117927 a(6) = binomial(15,6) = 5005.
%e A117927 a(7) = binomial(21,7) = 116280.
%e A117927 a(8) = binomial(22,8) = 319770.
%e A117927 a(9) = binomial(25,9) = 2042975.
%e A117927 a(10) = binomial(26,10) = 5311735.
%t A117927 Binomial[First[#],Last[#]]&/@With[{sprs=Select[Range[70],PrimeOmega[#] == 2&]},Thread[{sprs,Range[Length[sprs]]}]] (* _Harvey P. Dale_, Aug 10 2012 *)
%o A117927 (PARI) s(n) = my(k=1, nb=0); while (nb != n, if (bigomega(k)==2, nb++); if (nb != n, k++)); k; \\ A001358
%o A117927 a(n) = binomial(s(n), n); \\ _Michel Marcus_, Jul 15 2022
%Y A117927 Cf. A001358, A060604.
%K A117927 easy,nonn
%O A117927 1,1
%A A117927 _Jonathan Vos Post_, May 03 2006
%E A117927 More terms from _Michel Marcus_, Jul 15 2022