|
|
|
|
|
|
|
|
|
#13 by N. J. A. Sloane at Mon Sep 01 11:46:54 EDT 2014
|
|
|
|
|
|
|
|
#12 by Antti Karttunen at Sun Aug 31 15:42:09 EDT 2014
|
|
|
|
|
|
|
|
#11 by Antti Karttunen at Sat Aug 30 13:12:36 EDT 2014
|
|
| COMMENTS
|
This can be viewed as yet another "entanglement permutation" where the two complementary pairs to be interwoven together are even and odd numbers (A005843/A005408) which are entangled with the complementary pair even numbers (taken straight) and odd numbers in the order they appear in A003961: (A005843/A003961). Sequence A163511 has almost the same definition, but its domain starts from 0, which results a different permutation.
|
|
| CROSSREFS
|
Cf. A000035, A003961, A005408, A005843.
|
|
|
|
|
|
|
#10 by Antti Karttunen at Fri Aug 29 17:56:56 EDT 2014
|
|
| FORMULA
|
Other identities. For all n >= 1 the following holds:
|
|
|
|
|
|
|
#9 by Antti Karttunen at Fri Aug 29 17:55:20 EDT 2014
|
|
|
|
|
|
|
|
#8 by Antti Karttunen at Fri Aug 29 17:50:35 EDT 2014
|
|
|
|
|
|
|
|
#7 by Antti Karttunen at Wed Aug 27 17:40:07 EDT 2014
|
|
| PROG
|
(PARI)
default(primelimit, (2^31)+(2^30));
A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ Using code of Michel Marcus
A246375(n) = if(1==n, 1, if(!(n%2), 2*A246375(n/2), A003961(1+A246375((n-1)/2))));
for(n=1, 16384, write("b246375.txt", n, " ", A246375(n)));
|
|
|
|
|
|
|
#6 by Antti Karttunen at Wed Aug 27 17:36:31 EDT 2014
|
|
| LINKS
|
<a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
|
|
|
|
|
|
|
#5 by Antti Karttunen at Wed Aug 27 17:36:04 EDT 2014
|
|
| LINKS
|
Antti Karttunen, <a href="/A246375/b246375.txt">Table of n, a(n) for n = 1..16384</a>
|
|
|
|
|
|
|
#4 by Antti Karttunen at Wed Aug 27 16:08:13 EDT 2014
|
|
|
|
|
|
Discussion
|
| Wed Aug 27
| 16:08
| Antti Karttunen: A246365, A246367 should go to forthcoming A246379 instead.
|
|
|
|
|
|
