cp's OEIS Frontend

A284008 a(n) = lcm(A260443(n), A260443(1+n)).

%I A284008 #15 Mar 23 2017 11:45:03
%S A284008 2,6,6,30,90,90,30,210,630,450,1350,1890,3150,3150,210,2310,6930,3150,
%T A284008 47250,330750,992250,141750,47250,103950,173250,110250,330750,519750,
%U A284008 242550,242550,2310,30030,90090,34650,3638250,3638250,272868750,173643750,11576250,200103750,600311250,34728750,2604656250,28651218750,1910081250,272868750,3638250,9459450,15765750
%N A284008 a(n) = lcm(A260443(n), A260443(1+n)).
%H A284008 Antti Karttunen, <a href="/A284008/b284008.txt">Table of n, a(n) for n = 0..4096</a>
%H A284008 <a href="/index/Lc#lcm">Index entries for sequences related to lcm's</a>
%F A284008 a(n) = lcm(A260443(n), A260443(1+n)).
%F A284008 a(n) = A277324(n) / A277198(n).
%F A284008 Other identities. For all n >= 0:
%F A284008 A001222(a(n)) = A284009(n).
%t A284008 a[p_?PrimeQ] := a[p] = Prime[ PrimePi[p] + 1]; a[1] = 1; a[n_] := a[n] = Times @@ ( a[First[#]] ^ Last[#] & ) /@ FactorInteger[n]; (* after _Jean-François Alcover_, in A003961 *) A[n_]:= If[n<2, n + 1, If[EvenQ[n], a[A[n/2]], A[(n - 1)/2] A[(n + 1)/2]]] ;Table[A[n], {n, 0, 51}] (* sequence A260443 *) Table[LCM[A[n], A[n + 1]], {n, 0, 101}] (* _Indranil Ghosh_, Mar 22 2017 *)
%o A284008 (PARI)
%o A284008 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From _Michel Marcus_
%o A284008 A260443(n) = if(n<2, n+1, if(n%2, A260443(n\2)*A260443(n\2+1), A003961(A260443(n\2))));
%o A284008 A284008(n) = lcm(A260443(n),A260443(1+n));
%o A284008 (Scheme)
%o A284008 (define (A284008 n) (lcm (A260443 n) (A260443 (+ 1 n))))
%o A284008 (define (A284008 n) (/ (A277324 n) (A277198 n)))
%Y A284008 Cf. A260443, A277198, A277324, A277330, A284009.
%K A284008 nonn
%O A284008 0,1
%A A284008 _Antti Karttunen_, Mar 22 2017