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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A256487 a(n) = A254100(n) - A219178(n). 7

%I #7 May 01 2015 13:13:03

%S 2,4,0,4,10,18,16,36,28,48,78,80,62,90,76,110,134,158,200,220,224,216,

%T 236,280,308,312,262,314,328,402,430,424,438,488,506,538,414,510,642,

%U 620,680,648,656,690,666,684,730,790,742,840,844,862,916,976,1004,1092,1072,1112,1054,1166,1176,1184,1292

%N a(n) = A254100(n) - A219178(n).

%C 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="/A256487/b256487.txt">Table of n, a(n) for n = 1..933</a>

%H <a href="/index/Si#sieve">Index entries for sequences generated by sieves</a>

%F a(n) = A254100(n) - A219178(n).

%o (Scheme) (define (A256487 n) (- (A254100 n) (A219178 n)))

%Y Cf. A219178, A254100, A256482, A256486, A256488 (same terms divided by 2).

%K nonn

%O 1,1

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 13 11:10 EDT 2024. Contains 374282 sequences. (Running on oeis4.)