cp's OEIS Frontend

A286762 Indices k such that A195441(k) = A195441(k+1).

%I A286762 #41 Sep 10 2024 08:16:01
%S A286762 0,21,22,45,46,57,70,94,105,118,142,147,165,171,177,187,190,214,221,
%T A286762 222,225,237,238,261,267,281,286,291,313,315,318,334,345,350,357,358,
%U A286762 381,382,387,403,430,437,441,448,465,477,478,501,507,538,555,558,561,565
%N A286762 Indices k such that A195441(k) = A195441(k+1).
%C A286762 k is in this sequence if and only if the primes p less than or equal to (k+2)/(2+(k mod 2)) such that the sum of digits of k+1 in base p is at least p are also the primes less than or equal to (k+3)/(2+((k+1) mod 2)) such that the sum of digits of k+2 in base p is at least p.
%C A286762 For the comment above and the fact that the sequence is infinite, see Thm. 2 in "Power-Sum Denominators" and Cor. 3 in "The denominators of power sums of arithmetic progressions". - _Bernd C. Kellner_ and _Jonathan Sondow_, May 24 2017
%H A286762 Bernd C. Kellner, <a href="https://doi.org/10.1016/j.jnt.2017.03.020">On a product of certain primes</a>, J. Number Theory 179 (2017), 126-141; arXiv:<a href="https://arxiv.org/abs/1705.04303">1705.04303</a> [math.NT], 2017.
%H A286762 Bernd C. Kellner and Jonathan Sondow, <a href="https://doi.org/10.4169/amer.math.monthly.124.8.695">Power-Sum Denominators</a>, Amer. Math. Monthly 124 (2017), 695-709; arXiv:<a href="https://arxiv.org/abs/1705.03857">1705.03857</a> [math.NT], 2017.
%H A286762 Bernd C. Kellner and Jonathan Sondow, <a href="https://doi.org/10.5281/zenodo.10682734">The denominators of power sums of arithmetic progressions</a>, Integers 18 (2018), Article #A95, 17 pp.; arXiv:<a href="https://arxiv.org/abs/1705.05331">1705.05331</a> [math.NT], 2017.
%e A286762 21 and 22 are in this sequence because {2, 3, 5} is the set of primes which meet the given constraints. Let sd(n, p) denote the sum of digits of n in base p, then we have:
%e A286762 2 <= sd(22, 2) = 3; 3 <= sd(22, 3) = 4; 5 <= sd(22, 5) = 6;
%e A286762 2 <= sd(23, 2) = 4; 3 <= sd(23, 3) = 5; 5 <= sd(23, 5) = 7;
%e A286762 2 <= sd(24, 2) = 2; 3 <= sd(24, 3) = 4; 5 <= sd(24, 5) = 8.
%e A286762 All other candidates do not satisfy the requirements: sd(22,7) = 4; sd(22,11) = 2; sd(23,7) = 5; sd(24,7) = 6; sd(24,11) = 4; sd(24,13) = 12.
%t A286762 -1 + SequencePosition[Table[Denominator[Together[(BernoulliB[n + 1, x] - BernoulliB[n + 1])]], {n, 0, 600}], w_ /; And[SameQ @@ w, Length@ w == 2]][[All, 1]] (* _Michael De Vlieger_, Sep 22 2017, after _Jonathan Sondow_ at A195441 *)
%o A286762 (Julia)
%o A286762 function A286762_list(bound::Int)
%o A286762     L = fmpz[]; a = fmpz(0)
%o A286762     for n in 0:bound
%o A286762         u = A195441(n)
%o A286762         a == u && push!(L, n-1)
%o A286762         a = u
%o A286762     end
%o A286762 L end
%o A286762 println(A286762_list(566))
%Y A286762 Cf. A195441, A286516, A286763.
%K A286762 nonn
%O A286762 1,2
%A A286762 _Peter Luschny_, May 14 2017