|
%I #18 Nov 15 2019 21:32:11
%S 0,1,0,1,2,1,0,1,0,1,2,1,0,1,0,1,2,1,3,1,0,1,2,1,0,1,4,1,2,1,0,1,0,1,
%T 2,1,0,1,3,1,2,1,0,1,5,1,2,1,0,1,0,1,2,1,6,1,4,1,2,1,3,1,0,1,2,1,0,1,
%U 0,1,2,1,0,1,0,1,2,1,0,1,3,1,2,1,7,1,0
%N Unluckiness of n.
%C If n is lucky, a(n)=0; if n is unlucky, a(n) is the step at which n is rejected from the lucky number sieve.
%H Max Barrentine, <a href="/A265859/b265859.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = (1-A145649(n)) * A260438(n). - _Antti Karttunen_, Sep 11 2016, corrected Nov 15 2019
%o (Scheme) (define (A265859 n) (* (- 1 (A145649 n)) (A260438 n))) ;; _Antti Karttunen_, Sep 11 2016
%Y Cf. A000959, A050505, A145649, A260437, A260438.
%Y Cf. also arrays A255543, A255545.
%Y Cf. A271420 (analogous sequence).
%K nonn
%O 1,5
%A _Max Barrentine_, Dec 17 2015
|
