A269848 a(1) = 1, a(2n) = A065090(1+a(n)), a(2n+1) = A000040(a(A064989(2n+1))).
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
Offset: 1
Keywords
Crossrefs
Programs
-
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));
-
Scheme
;; With memoization-macro definec. (definec (A269848 n) (cond ((<= n 1) n) ((even? n) (A065090 (+ 1 (A269848 (/ n 2))))) (else (A000040 (A269848 (A064989 n))))))
Comments