login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A303819 a(n) is the least k > 0 such that A303809(k) = 2^n. 2

%I #11 May 03 2018 17:49:18

%S 1,2,4,12,16,48,144,720,1296,6480,32400,184320,331776,1658880,8294400,

%T 58060800,65536,196608,589824,2949120,5308416,26542080,132710400,

%U 928972800,3317760000,23224320000,162570240000,1788272640000,7965941760000,87625359360000

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

%C All terms belongs to A025487.

%H Rémy Sigrist, <a href="/A303819/b303819.txt">Table of n, a(n) for n = 0..180</a>

%H Rémy Sigrist, <a href="/A303819/a303819.gp.txt">PARI program for A303819</a>

%H 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 (PARI) See Links section.

%Y Cf. A025487, A303809.

%K nonn

%O 0,2

%A _Rémy Sigrist_, May 01 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 01:19 EDT 2024. Contains 375509 sequences. (Running on oeis4.)