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.

A092195 Primes p that do not divide A001008(k), the numerator of the k-th harmonic number H(k), for any k < p-1.

This page as a plain text file.
%I A092195 #5 Feb 16 2025 08:32:52
%S A092195 3,5,7,13,17,19,23,31,41,47,59,67,71,73,79,83,89,101,103,107,113,127,
%T A092195 131,139,149,151,157,163,167,179,181,191,193,197,211,223,229,233,239,
%U A092195 241,251,263,277,281,283,293,307,311,317,331,337,349,359,367,373,383
%N A092195 Primes p that do not divide A001008(k), the numerator of the k-th harmonic number H(k), for any k < p-1.
%C A092195 Harmonic primes A092101 are a subset of these primes. Because these primes are analogous to the regular primes A007703 that divide the numerators of Bernoulli numbers, they might be called H-regular primes. The density of these primes is about 0.6 -- very close to the density of regular primes.
%H A092195 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HarmonicNumber.html">Harmonic Number</a>
%H A092195 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RegularPrime.html">Regular Prime</a>
%t A092195 n=1; Table[While[cnt=0; n++; p=Prime[n]; k=1; h=0; While[k<=(p-1)/2, h=h+1/k; If[Mod[Numerator[h], p]==0, cnt++ ]; k++ ]; cnt>0, ]; p, {100}]
%Y A092195 Cf. A072984 (least k such that prime(n) divides A001008(k)).
%K A092195 nonn
%O A092195 1,1
%A A092195 _T. D. Noe_, Feb 24 2004