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.

A325944 Least k such that A296062(k) = n.

This page as a plain text file.
%I A325944 #14 May 20 2023 04:10:46
%S A325944 0,2,4,8,9,10,17,128,18,512,20,34,35,8192,66,36,37,38,1025,40,41,42,
%T A325944 69,514,70,132,1026,134217728,72,2050,73,134,74,8589934592,76,516,80,
%U A325944 136,81,549755813888,82,32770,84,138,139,518,264,140,141,142,265
%N A325944 Least k such that A296062(k) = n.
%C A325944 a(n) <= 2^n because A296062(2^n) = n.
%H A325944 Rémy Sigrist, <a href="/A325944/b325944.txt">Table of n, a(n) for n = 0..8192</a>
%H A325944 Rémy Sigrist, <a href="/A325944/a325944.gp.txt">PARI program</a>
%e A325944 For n = 8, A296062(a(8)) = A296062(18) = 8, and A296062(k) != 8 for all k < 18 = a(8).
%o A325944 (PARI) See Links section.
%Y A325944 Cf. A296062, A325942.
%K A325944 nonn
%O A325944 0,2
%A A325944 _Peter Kagey_, Sep 09 2019
%E A325944 More terms from _Rémy Sigrist_, May 20 2023