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.

A248979 Numbers n such that 11 is not a divisor of A002805(11*n).

This page as a plain text file.
%I A248979 #38 Mar 19 2020 11:14:47
%S A248979 0,33,77,110,847,880,924,957,1210,1243,1287,1320,9328,9372,9416,9702,
%T A248979 9768,10538,10582,10626,14201,14223,102608,102641,102685,102718,
%U A248979 103136,103158,116413,116457,116501,156255,156277,1128688,1128721,1128765,1128798,1129073
%N A248979 Numbers n such that 11 is not a divisor of A002805(11*n).
%C A248979 For other primes after a few exceptions it seems that all denominators of harmonic numbers are divisible by that prime. For 11 there are many more exceptions. Maybe infinitely many?
%e A248979 33 is in the sequence since H(33) = p/q and 11 is not a divisor of q. Here H(n) = Sum_{i=1..n} 1/i.
%e A248979 Of course if H(33) has no denominator with a factor 11 the same is true for 34, 35, ..., 43.
%o A248979 (Sage)
%o A248979 n = 10000
%o A248979 sum11 = 0
%o A248979 resu = [0]
%o A248979 for i in range(11, n, 11):
%o A248979     D = (1 / i).partial_fraction_decomposition()[1]
%o A248979     sum11 += sum(v for v in D if 11.divides(v.denominator()))
%o A248979     if sum11 >= 1:
%o A248979         sum11 -= 1
%o A248979     if sum11 == 0:
%o A248979         resu.append(i)
%o A248979 resu
%o A248979 (PARI) lista(nn) = {forstep (n=0, nn, 11, if (denominator(sum(k=2,n,1/k)) % 11, print1(n, ", ")););} \\ _Michel Marcus_, Oct 19 2014
%Y A248979 Cf. A002805.
%K A248979 nonn
%O A248979 1,2
%A A248979 _Matthijs Coster_, Oct 18 2014