login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A332460 a(n) = A005940(1+A065621(A156552(n))), with a(1) = 1. 2

%I

%S 1,2,3,8,5,18,7,12,27,50,11,32,13,98,75,20,17,30,19,72,147,242,23,108,

%T 125,338,45,200,29,162,31,28,363,578,245,48,37,722,507,300,41,450,43,

%U 392,243,1058,47,500,343,70,867,968,53,42,605,588,1083,1682,59,128,61,1922,675,44,845,882,67,1352,1587,1250,71,180,73,2738,105

%N a(n) = A005940(1+A065621(A156552(n))), with a(1) = 1.

%H Antti Karttunen, <a href="/A332460/b332460.txt">Table of n, a(n) for n = 1..16384</a>

%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>

%F a(1) = 1, and for n > 1, a(n) = A005940(1+A065621(A156552(n))).

%F a(p) = p for all primes p.

%F a(A003961(n)) = A003961(a(n)).

%F A008836(a(n)) = -1 for all n >= 2.

%o (PARI)

%o A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940

%o A065621(n) = bitxor(n-1,n+n-1);

%o A156552(n) = {my(f = factor(n), p2 = 1, res = 0); for(i = 1, #f~, p = 1 << (primepi(f[i, 1]) - 1); res += (p * p2 * (2^(f[i, 2]) - 1)); p2 <<= f[i, 2]); res}; \\ From A156552

%o A332460(n) = A005940(1+A065621(A156552(n)));

%Y Cf. A003961, A005940, A008836, A010052, A065621, A156552, A332449, A332450.

%Y Cf. A332451 for a complementary sequence (after its initial 1).

%Y Permutation of A026424 after the initial 1.

%K nonn

%O 1,2

%A _Antti Karttunen_, Feb 22 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 10 00:05 EDT 2020. Contains 335570 sequences. (Running on oeis4.)