The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A256488 a(n) = A256487(n)/2 = (A254100(n) - A219178(n))/2. 3
 1, 2, 0, 2, 5, 9, 8, 18, 14, 24, 39, 40, 31, 45, 38, 55, 67, 79, 100, 110, 112, 108, 118, 140, 154, 156, 131, 157, 164, 201, 215, 212, 219, 244, 253, 269, 207, 255, 321, 310, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 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. LINKS Antti Karttunen, Table of n, a(n) for n = 1..933 FORMULA a(n) = A256487(n)/2 = (A254100(n) - A219178(n))/2. PROG (Scheme) (define (A256488 n) (/ (A256487 n) 2)) CROSSREFS Cf. A219178, A254100, A256482, A256486, A256487. Sequence in context: A110282 A024308 A059432 * A175631 A243816 A243159 Adjacent sequences: A256485 A256486 A256487 * A256489 A256490 A256491 KEYWORD nonn AUTHOR Antti Karttunen, May 01 2015 STATUS approved

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

Last modified February 7 02:40 EST 2023. Contains 360111 sequences. (Running on oeis4.)