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.

A356153 Denominator of n / the smallest positive k such that n divides k*A276086(k), where A276086 is primorial base exp-function.

This page as a plain text file.
%I A356153 #9 Jul 28 2022 15:15:37
%S A356153 1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,1,1,1,2,1,1,1,1,1,1,1,1,1,
%T A356153 1,1,1,1,2,1,1,1,1,1,1,1,1,1,5,1,1,1,1,1,1,4,2,1,1,2,1,1,1,1,1,1,1,1,
%U A356153 1,1,1,2,1,1,2,1,3,1,1,1,1,1,1,1,1,1,1,1,1,1,3,1,2,1,1,1,1,5,1,3,1,1,1,1,2
%N A356153 Denominator of n / the smallest positive k such that n divides k*A276086(k), where A276086 is primorial base exp-function.
%H A356153 Antti Karttunen, <a href="/A356153/b356153.txt">Table of n, a(n) for n = 1..65537</a>
%H A356153 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A356153 a(n) = A355944(n) / A356151(n) = A355944(n) / gcd(n, A355944(n)).
%o A356153 (PARI)
%o A356153 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A356153 A356153(n) = for(k=1, oo, if((k*A276086(k))%n==0, return(k/gcd(n,k))));
%Y A356153 Cf. A276086, A324580, A355944, A355945, A356151, A356152 (numerators), A356154 (Dirichlet inverse).
%K A356153 nonn,frac
%O A356153 1,3
%A A356153 _Antti Karttunen_, Jul 28 2022