|
%I #8 Apr 06 2017 21:22:00
%S 1,3,9,3,9,27,9,21,63,27,81,189,63,189,441,21,63,1323,567,1323,3969,
%T 1701,3969,1323,441,9261,27783,1323,3087,9261,441,273,819,1323,27783,
%U 64827,27783,583443,1361367,9261,27783,4084101,1750329,583443,1361367,583443,194481,17199,5733,453789,9529569,453789,1361367,28588707,1361367,120393,280917,453789,1361367
%N a(n) = A248101(A277324(n)).
%H Antti Karttunen, <a href="/A284564/b284564.txt">Table of n, a(n) for n = 0..4096</a>
%F a(n) = A248101(A277324(n)).
%F a(n) = A284554((2*n)+1).
%F Other identities. For all n >= 0:
%F A001222(a(n)) = A284566(n).
%t a[n_] := a[n] = Which[n < 2, n + 1, EvenQ@ n, Times @@ Map[#1^#2 & @@ # &, FactorInteger[#] /. {p_, e_} /; e > 0 :> {Prime[PrimePi@ p + 1], e}] - Boole[# == 1] &@ a[n/2], True, a[#] a[# + 1] &[(n - 1)/2]]; Table[Times @@ (FactorInteger[#] /. {p_, e_} /; e > 0 :> (p^Mod[PrimePi@ p + 1, 2])^e) &@ a[2 n + 1], {n, 0, 58}] (* _Michael De Vlieger_, Apr 05 2017 *)
%o (PARI) A284564(n) = A284554(n+n+1); \\ Other code as in A284554.
%o (Scheme)
%o (define (A284564 n) (A248101 (A277324 n)))
%o (define (A284564 n) (A284554 (+ n n 1)))
%Y Cf. A001222, A248101, A277324, A284554, A284563, A284566.
%K nonn
%O 0,2
%A _Antti Karttunen_, Mar 29 2017
|
