|
%I #29 Apr 25 2024 10:33:12
%S 1,1,2,1,2,1,3,1,3,1,2,1,4,1,4,1,2,1,5,1,3,1,2,1,5,1,6,1,2,1,6,1,3,1,
%T 2,1,4,1,7,1,2,1,7,1,3,1,2,1,8,1,5,1,2,1,4,1,3,1,2,1,8,1,9,1,2,1,9,1,
%U 3,1,2,1,6,1,4,1,2,1,10,1,3,1,2,1,5,1,10,1,2,1,11,1,3,1,2,1,4,1,7,1,2,1,11,1,3,1,2,1,12,1,5,1,2,1,4,1,3,1,2,1
%N a(n) = index of the row where n is located in array A278505.
%C Ordinal transform of A278539 (most likely, but hinges on that also the columns of A278505 are strictly growing).
%H Antti Karttunen, <a href="/A278538/b278538.txt">Table of n, a(n) for n = 1..10707</a>
%H <a href="/index/J#Josephus">Index entries for sequences related to the Josephus Problem</a>
%F If A278169(n) = 1, a(n) = A100617(n), otherwise a(n) = A278528(n).
%F If n = A000960(k), a(n) = k, otherwise a(n) = number of the round in which n is removed in the Flavius sieve.
%o (Scheme)
%o (define (A278538 n) (if (not (zero? (A278169 n))) (A100617 n) (A278528 n)))
%Y Cf. A000960, A100617, A278169, A278505, A278507, A278536, A278537, A278539.
%K nonn,changed
%O 1,3
%A _Antti Karttunen_, Nov 23 2016
|
