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.

A303819 a(n) is the least k > 0 such that A303809(k) = 2^n.

This page as a plain text file.
%I A303819 #11 May 03 2018 17:49:18
%S A303819 1,2,4,12,16,48,144,720,1296,6480,32400,184320,331776,1658880,8294400,
%T A303819 58060800,65536,196608,589824,2949120,5308416,26542080,132710400,
%U A303819 928972800,3317760000,23224320000,162570240000,1788272640000,7965941760000,87625359360000
%N A303819 a(n) is the least k > 0 such that A303809(k) = 2^n.
%C A303819 All terms belongs to A025487.
%H A303819 Rémy Sigrist, <a href="/A303819/b303819.txt">Table of n, a(n) for n = 0..180</a>
%H A303819 Rémy Sigrist, <a href="/A303819/a303819.gp.txt">PARI program for A303819</a>
%H A303819 Rémy Sigrist, <a href="/A303819/a303819.png">Scatterplot of (n, k) such that n, k <= 286 and a(k) divides a(n)</a>
%o A303819 (PARI) See Links section.
%Y A303819 Cf. A025487, A303809.
%K A303819 nonn
%O A303819 0,2
%A A303819 _Rémy Sigrist_, May 01 2018