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.

A261523 a(n) = prime(n+1)! / (prime(n+1) - prime(n))!.

This page as a plain text file.
%I A261523 #31 Sep 08 2022 08:46:13
%S A261523 6,60,2520,1663200,3113510400,14820309504000,60822550204416000,
%T A261523 1077167364120207360000,12280224991305141603532800000,
%U A261523 4111419327088961408862781440000000,19116323737814368119883304974417920000000,1393855275548491962840419252226697986048000000000,30207631531686917818677566034256998753632256000000000
%N A261523 a(n) = prime(n+1)! / (prime(n+1) - prime(n))!.
%C A261523 The author comments that this sequence is related to the product A058077(n) * A039716(n). - _Charles R Greathouse IV_, Aug 29 2015
%F A261523 a(n) = prime(n+1)! / (prime(n+1) - prime(n))! = A058077(n) * A039716(n).
%p A261523 A261523:=n->ithprime(n+1)!/(ithprime(n+1)-ithprime(n))!: seq(A261523(n), n=1..15); # _Wesley Ivan Hurt_, Aug 23 2015
%t A261523 Table[Prime[i + 1]!/(Prime[i + 1] - Prime[i])!, {i, 15}] (* _Vincenzo Librandi_, Aug 23 2015 *)
%o A261523 (PARI) vector( 15,  n,  prime(n+1)! / (prime(n+1) - prime(n))! )
%o A261523 (PARI) vector( 15,  n,  binomial(prime(n+1), prime(n)) * prime(n)! )
%o A261523 (Magma) [Factorial(NthPrime(n+1)) / Factorial((NthPrime(n+1) - NthPrime(n))): n in [1..15]]; // _Vincenzo Librandi_, Aug 23 2015
%Y A261523 Cf. A058077, A039716.
%K A261523 nonn,easy
%O A261523 1,1
%A A261523 _Altug Alkan_, Aug 23 2015