|
%I #6 Aug 26 2014 01:26:08
%S 1,2,3,4,6,8,9,10,12,14,15,16,18,20,21,24,25,26,27,28,30,32,33,35,36,
%T 39,40,42,44,45,48,49,50,52,54,56,57,60,63,64,66,68,69,70,72,75,76,78,
%U 80,81,84,88,90,91,92,93,96,98,99,100,102,104,105,108,110,112,114,116,117,120,124,125,126,128,130,132
%N Numbers n such that A048673(n) >= n.
%H Antti Karttunen, <a href="/A246352/b246352.txt">Table of n, a(n) for n = 1..10000</a>
%o (PARI)
%o default(primelimit, 2^22);
%o A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From _Michel Marcus_
%o A048673(n) = (A003961(n)+1)/2;
%o isA246352(n) = (A048673(n) >= n);
%o n = 0; i = 0; while(i < 10000, n++; if(isA246352(n), i++; write("b246352.txt", i, " ", n)));
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A246352 (MATCHING-POS 1 1 (lambda (n) (>= (A048673 n) n))))
%Y Complement: A246351
%Y Union of A246282 and A048674.
%Y Subsequence: A029744 (gives the positions of records in A048673).
%Y Cf. A246372.
%K nonn
%O 1,2
%A _Antti Karttunen_, Aug 24 2014
|
