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.

A356094 a(n) = denominator((prime(n)-1)/prime(n)#), where prime(n)# = A002110(n) is the n-th primorial.

This page as a plain text file.
%I A356094 #14 Jul 30 2022 08:18:39
%S A356094 2,3,15,35,231,5005,255255,1616615,10140585,462120945,6685349671,
%T A356094 1236789689135,30425026352721,311494317420715,13367169186706335,
%U A356094 1253429172199617105,33151040519900217915,3909612711980232366109,119065478046670712967865,7970583287524270870963077
%N A356094 a(n) = denominator((prime(n)-1)/prime(n)#), where prime(n)# = A002110(n) is the n-th primorial.
%C A356094 See A356093 for details.
%H A356094 Amiram Eldar, <a href="/A356094/b356094.txt">Table of n, a(n) for n = 1..351</a>
%t A356094 primorial[n_] := Product[Prime[i], {i, 1, n}]; Denominator[Table[(Prime[i] - 1)/primorial[i], {i, 1, 20}]]
%o A356094 (PARI) a(n) = denominator((prime(n)-1)/factorback(primes(n))); \\ _Michel Marcus_, Jul 26 2022
%o A356094 (Python)
%o A356094 from math import gcd
%o A356094 from sympy import primorial, prime
%o A356094 def A356094(n): return (p:=primorial(n))//gcd(p,prime(n)-1) # _Chai Wah Wu_, Jul 26 2022
%Y A356094 Cf. A002110, A356093 (numerators).
%Y A356094 Similar sequences: A038111, A338560, A340819, A341432, A342451, A342480.
%K A356094 nonn,frac
%O A356094 1,1
%A A356094 _Amiram Eldar_, Jul 26 2022