|
%I #23 Jan 26 2018 05:19:30
%S 4,6,8,10,14,20,22,27,30,35,44,46,54,58,62,66,75,82,85,92,96,99,108,
%T 114,120,129,134,136,142,144,148,166,171,178,182,194,196,204,210,215,
%U 221,230,232,245,247,252,254,268,285,289,291,296,302,304,318
%N c(p(n)) where p(k) is k-th prime including p(1)=1 and c(k) is k-th composite number.
%C a(n) U A050435(n) = A002808(n), a(n+1) U A175251(n) = A002808(n) for n >= 1. a(n) = A065858(n-1) = composites (A002808) with prime (A000040) subscripts for n >=2. [From _Jaroslav Krizek_, Mar 13 2010]
%D C. Kimberling, Fractal sequences and interspersions, Ars Combinatoria, vol. 45 p 157 1997.
%H Reinhard Zumkeller, <a href="/A022449/b022449.txt">Table of n, a(n) for n = 1..10000</a>
%H C. Kimberling, <a href="http://faculty.evansville.edu/ck6/integer/intersp.html">Interspersions</a>
%F a(n) = A002808(A008578(n)). - _Jaroslav Krizek_, Mar 13 2010
%e a(5) = 14 because a(5) = composite(noncomposite(5)) = composite(7) =14. _Jaroslav Krizek_, Mar 13 2010
%p A022449 := proc(n)
%p A002808(A008578(n)) ;
%p end proc:
%p seq(A022449(n),n=1..40) ; # _R. J. Mathar_, Jan 28 2014
%t p[1] = 1; p[n_] := Prime[n - 1];
%t Composite[n_] := FixedPoint[n + PrimePi[#] + 1 & , n + PrimePi[n] + 1];
%t a[n_] := Composite[p[n]];
%t Array[a, 100] (* _Jean-François Alcover_, Jan 26 2018, after _Robert G. Wilson v_ *)
%o (Haskell)
%o a022449 = a002808 . a008578
%o a022449_list = map a002808 a008578_list
%o -- _Reinhard Zumkeller_, Jan 12 2013
%Y A065858 with a leading 4.
%K nonn
%O 1,1
%A _Clark Kimberling_
%E Definition corrected by Christopher M. Tomaszewski (cmt1288(AT)comcast.net), Mar 30 2005
|
