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.

A369119 a(n) = (n + 1)^[is_prime(n + 1)] * n!.

This page as a plain text file.
%I A369119 #10 Jan 15 2024 14:44:38
%S A369119 1,2,6,6,120,120,5040,5040,40320,362880,39916800,39916800,6227020800,
%T A369119 6227020800,87178291200,1307674368000,355687428096000,355687428096000,
%U A369119 121645100408832000,121645100408832000,2432902008176640000,51090942171709440000
%N A369119 a(n) = (n + 1)^[is_prime(n + 1)] * n!.
%F A369119 a(2*n)*Bernoulli(2*n) = A347425(n).
%t A369119 A369119[n_] := n! If[PrimeQ[n+1], n+1, 1];
%t A369119 Array[A369119, 25, 0] (* _Paolo Xausa_, Jan 15 2024 *)
%o A369119 (SageMath)
%o A369119 def A369119(n): return (n+1)^is_prime(n+1)*factorial(n)
%Y A369119 Cf. A089026, A000142, A347425, A000367/A002445 (Bernoulli(2n)).
%K A369119 nonn
%O A369119 0,2
%A A369119 _Peter Luschny_, Jan 14 2024