|
%I #22 Dec 19 2019 11:38:12
%S 1,3,2,6,4,12,5,15,7,21,8,24,9,27,10,30,11,33,13,39,14,42,16,48,17,51,
%T 18,54,19,57,20,60,22,66,23,69,25,75,26,78,28,84,29,87,31,93,32,96,34,
%U 102,35,105,36,108,37,111,38,114,40,120,41,123,43,129,44,132,45,135,46
%N List of pairs n, 3n, where n is the least unused number so far.
%C A permutation of the natural numbers.
%H T. D. Noe, <a href="/A092401/b092401.txt">Table of n, a(n) for n=1..1000</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F a(2n-1) = A007417(n), a(2n) = 3*A007417(n).
%t A007417 = Select[ Range[100], (# // IntegerDigits[#, 3]& // Split // Last // Count[#, 0]& // EvenQ)&]; a[n_] := If[ OddQ[n], A007417[[(n+1)/2]], 3*A007417[[n/2]] ]; Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Mar 01 2013, from formula *)
%o (Haskell)
%o import Data.List (delete)
%o a092401 n = a092401_list !! (n-1)
%o a092401_list = f [1..] where
%o f (x:xs) = x : x' : f (delete x' xs) where x' = 3*x
%o -- _Reinhard Zumkeller_, Jan 03 2012
%Y Cf. A036552, A203602 (inverse).
%K easy,nice,nonn
%O 1,2
%A _Philippe Deléham_, Mar 22 2004
|
