cp's OEIS Frontend

A165634 Start with x=1 and repeat: if x is a prime number then (append i and then x, with x=prime(i)) else (only append x), continue with x:=x+1.

%I A165634 #9 Jul 13 2013 12:03:39
%S A165634 1,1,2,2,3,4,3,5,6,4,7,8,9,10,5,11,12,6,13,14,15,16,7,17,18,8,19,20,
%T A165634 21,22,9,23,24,25,26,27,28,10,29,30,11,31,32,33,34,35,36,12,37,38,39,
%U A165634 40,13,41,42,14,43,44,45,46,15,47,48,49,50,51,52,16,53,54,55,56,57,58,17,59
%N A165634 Start with x=1 and repeat: if x is a prime number then (append i and then x, with x=prime(i)) else (only append x), continue with x:=x+1.
%C A165634 All positive integers occur exactly twice: A095117 and A095116 give positions of first and second occurrences.
%H A165634 Reinhard Zumkeller, <a href="/A165634/b165634.txt">Table of n, a(n) for n = 1..10000</a>
%e A165634 1,(1,2),(2,3),4,(3,5),6,(4,7),8,9,10,(5,11),12, ... .
%o A165634 (Haskell)
%o A165634 a165634 n = a165634_list !! (fromInteger n - 1)
%o A165634 a165634_list = concatMap (\x ->
%o A165634    if a010051 x == 1 then [a049084 x, x] else [x]) [1..]
%o A165634 -- _Reinhard Zumkeller_, Apr 17 2012
%Y A165634 A049084, A000040.
%K A165634 nonn
%O A165634 1,3
%A A165634 _Reinhard Zumkeller_, Sep 23 2009