login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #22 Oct 18 2014 09:12:54

%S 2,6,13,22,26,41,50,54,89,105,101,109,178,166,118,185,217,218,201,357,

%T 361,358,422,329,434,425,429,418,617,441,666,717,845,722,745,741,718,

%U 873,869,841,846,1430,882,844,866,934,946,1446,1434,885,1690,1625,1445,1686,949,1714,1497

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

%H N. J. A. Sloane, <a href="/A215246/b215246.txt">Table of n, a(n) for n = 1..307</a>

%e A215244(k) = 4 for k = 7,8,12,14,18,22, so a(4) = 22.

%p # Since A214245(12)=95, the following program gives correct values for a(n) for n <= 94.

%p A215246:=proc(M) local lis,n,p,i;

%p lis:=array(1..1024);

%p for n from 1 to M do

%p p:=A215244(n);

%p if p <= 1024 then lis[p]:=n; fi;

%p od;

%p [seq(lis[i],i=1..94)];

%p end proc;

%p A215246(2^12 - 1);

%Y Cf. A215244, A215245, A215253, A215254.

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_, Aug 07 2012