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.

A045957 Twin even-lucky-numbers: middle terms.

This page as a plain text file.
%I A045957 #11 Mar 20 2024 03:04:32
%S A045957 3,5,11,19,21,35,43,51,53,69,99,101,115,117,131,139,149,171,197,213,
%T A045957 229,245,261,299,309,325,373,387,389,419,435,437,517,523,533,547,587,
%U A045957 597,629,643,645,707,709,715,739,741,779,869,883,885,915,963,965,995,997,1091
%N A045957 Twin even-lucky-numbers: middle terms.
%C A045957 Numbers k such that both k-1 and k+1 are even-lucky numbers (A045954). - _Amiram Eldar_, Mar 20 2024
%H A045957 Amiram Eldar, <a href="/A045957/b045957.txt">Table of n, a(n) for n = 1..10000</a>
%F A045957 a(n) = A045955(n) + 1 = A045956(n) - 1. - _Amiram Eldar_, Mar 20 2024
%t A045957 evenLuckies[max_] := Module[{lst = Range[2, max, 2], i = 2, len}, While[i <= (len = Length@lst) && (k = lst[[i]]) <= len, lst = Drop[lst, {k, len, k}]; i++]; lst]; twinMid[max_] := Module[{s = evenLuckies[max]}, s[[Position[ Differences[s], 2] // Flatten]] + 1]; twinMid[1100] (* _Amiram Eldar_, Mar 20 2024, after _Robert G. Wilson v_ at A045954 *)
%Y A045957 Cf. A045954, A045955, A045956.
%K A045957 nonn
%O A045957 1,1
%A A045957 _Felice Russo_