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.

A382271 Smallest k such that A073734(k) = 2^n, where A073734 is the GCD of consecutive terms of the EKG sequence A064413.

This page as a plain text file.
%I A382271 #13 Mar 23 2025 13:54:09
%S A382271 2,3,8,17,3070,20143,46660,187759,1339550,2692614,81281233,61760615,
%T A382271 98845851
%N A382271 Smallest k such that A073734(k) = 2^n, where A073734 is the GCD of consecutive terms of the EKG sequence A064413.
%C A382271 a(13) > 1.045*10^9.
%e A382271 a(3) = 17 as A064413(17) = 16, A064413(16) = 24, and GCD(16,24) = 8 = 2^3. No earlier pair of consecutive terms in A064413 has a GCD of 8.
%Y A382271 Cf. A064413, A073734, A382222, A064740, A073735.
%K A382271 nonn,more
%O A382271 0,1
%A A382271 _Scott R. Shannon_ and _Michael De Vlieger_, Mar 20 2025