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.

A303823 a(n) is the least k > 0 such that A303822(k) = 3^n.

This page as a plain text file.
%I A303823 #11 May 03 2018 17:47:45
%S A303823 1,2,6,4,12,60,36,180,1260,64,192,960,576,2880,20160,14400,100800,
%T A303823 1108800,46656,233280,1632960,1166400,8164800,89812800,57153600,
%U A303823 628689600,8172964800,16,48,240,144,720,5040,3600,25200,277200,5184,25920,181440,129600
%N A303823 a(n) is the least k > 0 such that A303822(k) = 3^n.
%C A303823 All terms belong to A025487.
%H A303823 Rémy Sigrist, <a href="/A303823/b303823.txt">Table of n, a(n) for n = 0..2131</a>
%H A303823 Rémy Sigrist, <a href="/A303823/a303823.gp.txt">PARI program for A303823</a>
%H A303823 Rémy Sigrist, <a href="/A303823/a303823.png">Scatterplot of (n, k) such that n, k <= 999 and a(k) divides a(n)</a>
%o A303823 (PARI) See Links section.
%Y A303823 Cf. A025487, A303822.
%K A303823 nonn
%O A303823 0,2
%A A303823 _Rémy Sigrist_, May 01 2018