|
%I #12 Sep 23 2014 05:07:37
%S 1,2,3,4,5,7,6,8,10,12,9,11,14,16,19,13,15,18,21,24,27,17,20,23,26,30,
%T 33,37,22,25,29,32,36,40,44,49,28,31,35,39,43,47,52,57,62,34,38,42,46,
%U 51,55,60,66,71,77,41,45,50,54,59,64,69,75,81,87,93,48
%N Position of A036561(n) in sequence A003586.
%C Motivated by _L. Edson Jeffery_ comment in A036561 that says it is a permutation of A003586.
%H Reinhard Zumkeller, <a href="/A247714/b247714.txt">Table of n, a(n) for n = 0..10000</a>
%p N0:= 10: # to get the first (N0+1)*(N0+2)/2 terms
%p V:= 3^N0:
%p S:= {seq(seq(2^i*3^j, i=0..ilog2(V/3^j)),j=0..N0)}:
%p # in Maple 11 or earlier, uncomment the next line and comment out the previous one
%p # S:= sort([seq(seq(2^i*3^j, i=0..ilog2(V/3^j)),j=0..N0)]):
%p for k from 1 to nops(S) do
%p r:= S[k];
%p jr:= padic[ordp](r,3);
%p ir:= jr + padic[ordp](r,2);
%p A[1+jr+ir*(ir+1)/2] := k;
%p od:
%p seq(A[k],k=1..(N0+1)*(N0+2)/2); # _Robert Israel_, Sep 22 2014
%o (PARI) lista(nn) = {w = readvec("b036561.txt"); v = readvec("b003586.txt"); for (i=1, nn, print1(setsearch(v, w[i], 0), ", "););}
%o (Haskell)
%o import Data.List (elemIndex); import Data.Maybe (fromJust)
%o a247714 = (+ 1) . fromJust .
%o (`elemIndex` a003586_list) . (a036561_list !!)
%o -- _Reinhard Zumkeller_, Sep 23 2014
%Y Cf. A003586, A036561.
%K nonn
%O 0,2
%A _Michel Marcus_, Sep 22 2014
|
