Revision History for A269848
(Underlined text is an addition;
strikethrough text is a deletion.)
Showing entries 1-10
| older changes
|
| |
| |
| |
|
|
#15 by N. J. A. Sloane at Mon Mar 07 12:31:35 EST 2016
| |
| |
| |
|
|
#14 by Antti Karttunen at Sun Mar 06 15:11:19 EST 2016
| |
| |
| |
|
|
#13 by Antti Karttunen at Sun Mar 06 14:21:33 EST 2016
| |
| |
| |
|
|
#12 by Antti Karttunen at Sun Mar 06 13:52:33 EST 2016
| |
| |
| |
|
|
#11 by Antti Karttunen at Sun Mar 06 13:47:55 EST 2016
| |
| |
| |
|
|
#10 by Antti Karttunen at Sun Mar 06 13:43:36 EST 2016
| |
| |
| |
|
|
#9 by Antti Karttunen at Sun Mar 06 13:41:10 EST 2016
| |
| |
| |
|
|
#8 by Antti Karttunen at Sun Mar 06 13:37:14 EST 2016
|
|
| DATA
|
1, 2, 3, 4, 5, 6, 11, 8, 7, 9, 31, 10, 127, 18, 13, 14, 709, 12, 5381, 15, 23, 45, 52711, 16, 17, 165, 19, 27, 648391, 21, 9737333, 22, 61, 856, 41, 20, 174440041, 6185, 197, 24, 3657500101, 34, 88362852307, 63, 29, 58644, 2428095424619, 25, 59, 26, 977, 212
|
|
| COMMENTS
|
Term a(47) manually copied from A007097(15). Note that A000040(15) = 47.
|
|
| PROG
|
(PARI)
allocatemem(2^30);
default(primelimit, 4294965247);
A002808(n) = { my(k=-1); while( -n + n += -k + k=primepi(n), ); n}; \\ This function from M. F. Hasler
A064989(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f)};
A269848 = n -> if(n<=2, n, if((n%2), prime(A269848(A064989(n))), A002808(A269848(n/2)-1)));
for(n=1, 52, t = A269848(n); print1(t, ", "); write("b269848.txt", n, " ", t));
|
| |
| |
|
|
#7 by Antti Karttunen at Sun Mar 06 13:17:05 EST 2016
| |
| |
| |
|
|
#6 by Antti Karttunen at Sun Mar 06 12:53:28 EST 2016
| |
| |
| |
|
|
