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.

A215246 a(n) = maximal value of k such that A215244(k) = n.

This page as a plain text file.
%I A215246 #22 Oct 18 2014 09:12:54
%S A215246 2,6,13,22,26,41,50,54,89,105,101,109,178,166,118,185,217,218,201,357,
%T A215246 361,358,422,329,434,425,429,418,617,441,666,717,845,722,745,741,718,
%U A215246 873,869,841,846,1430,882,844,866,934,946,1446,1434,885,1690,1625,1445,1686,949,1714,1497
%N A215246 a(n) = maximal value of k such that A215244(k) = n.
%H A215246 N. J. A. Sloane, <a href="/A215246/b215246.txt">Table of n, a(n) for n = 1..307</a>
%e A215246 A215244(k) = 4 for k = 7,8,12,14,18,22, so a(4) = 22.
%p A215246 # Since A214245(12)=95, the following program gives correct values for a(n) for n <= 94.
%p A215246 A215246:=proc(M) local lis,n,p,i;
%p A215246 lis:=array(1..1024);
%p A215246 for n from 1 to M do
%p A215246 p:=A215244(n);
%p A215246 if p <= 1024 then lis[p]:=n; fi;
%p A215246                   od;
%p A215246 [seq(lis[i],i=1..94)];
%p A215246 end proc;
%p A215246 A215246(2^12 - 1);
%Y A215246 Cf. A215244, A215245, A215253, A215254.
%K A215246 nonn,base
%O A215246 1,1
%A A215246 _N. J. A. Sloane_, Aug 07 2012