login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A256488 a(n) = A256487(n)/2 = (A254100(n) - A219178(n))/2. 3

%I

%S 1,2,0,2,5,9,8,18,14,24,39,40,31,45,38,55,67,79,100,110,112,108,118,

%T 140,154,156,131,157,164,201,215,212,219,244,253,269,207,255,321,310,

%U 340,324,328,345,333,342,365,395,371,420,422,431,458,488,502,546,536,556,527,583,588,592,646,643,639,665,688,662,662

%N a(n) = A256487(n)/2 = (A254100(n) - A219178(n))/2.

%C Half the difference between the least nonludic number removed at the n-th stage of Ludic sieve and the least unlucky number removed at the n-th stage of Lucky sieve.

%H Antti Karttunen, <a href="/A256488/b256488.txt">Table of n, a(n) for n = 1..933</a>

%F a(n) = A256487(n)/2 = (A254100(n) - A219178(n))/2.

%o (Scheme) (define (A256488 n) (/ (A256487 n) 2))

%Y Cf. A219178, A254100, A256482, A256486, A256487.

%K nonn

%O 1,2

%A _Antti Karttunen_, May 01 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 28 11:24 EDT 2020. Contains 337393 sequences. (Running on oeis4.)