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.

A382360 a(n) is the unique k such that A382357(k) = 2^n.

This page as a plain text file.
%I A382360 #6 Mar 26 2025 16:16:57
%S A382360 1,2,5,6,27,28,87,88,371,372,1303,1304,5717,5718,27099,27100,100637,
%T A382360 100638,429041,429042,1676037,1676038,6566201,6566202,26703687,
%U A382360 26703688,105939329,105939330,424972311,424972312,1688465121,1688465122,6744826613,6744826614
%N A382360 a(n) is the unique k such that A382357(k) = 2^n.
%H A382360 Rémy Sigrist, <a href="/A382360/a382360.gp.txt">PARI program</a>
%H A382360 Rémy Sigrist, <a href="/A382360/a382360.txt">C++ program</a>
%F A382360 Empirically: a(2*n+1) = a(2*n)+1.
%e A382360 A382357(27) = 2^4, so a(4) = 27.
%o A382360 (PARI) \\ See Links section.
%o A382360 (C++) // See Links section.
%Y A382360 Cf. A382357.
%K A382360 nonn,base
%O A382360 0,2
%A A382360 _Rémy Sigrist_, Mar 22 2025