|
Search: id:A100527
|
|
|
| A100527 |
|
a(1) = 1, n>1: a(n) = smallest m<>n and not occurring earlier such that m has as many prime-factors as n has (with repetition). |
|
+0
3
|
|
| 1, 3, 2, 6, 7, 4, 5, 12, 10, 9, 13, 8, 11, 15, 14, 24, 19, 20, 17, 18, 22, 21, 29, 16, 26, 25, 28, 27, 23, 42, 37, 48, 34, 33, 38, 40, 31, 35, 46, 36, 43, 30, 41, 45, 44, 39, 53, 32, 51, 52, 49, 50, 47, 56, 57, 54, 55, 62, 61, 81, 59, 58, 66, 96, 69, 63, 71, 70, 65, 68, 67, 80
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(a(n))=n: a self-inverse permutation with A001222(a(n))=A001222(n).
|
|
LINKS
|
Index entries for sequences that are permutations of the natural numbers
|
|
PROGRAM
|
Contribution from Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 16 2009: (Start)
(PARI) invect(v, n, x)=for(i=1, n, if(v[i]==x, return(1))); 0
nextnew(v, n)=local(k); k=1; while(!R(n, k)||invect(v, n-1, k), k++); k
newvect(n)=local(v); v=vector(n); for(k=1, n, v[k]=nextnew(v, k)); v
R(n, m)=bigomega(n)==bigomega(m)&&n!=m||n==1&&m==1
newvect(80) (End)
|
|
CROSSREFS
|
Cf. A094681, A159588. [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 16 2009]
Sequence in context: A102004 A125764 A023897 this_sequence A063946 A154441 A154446
Adjacent sequences: A100524 A100525 A100526 this_sequence A100528 A100529 A100530
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 25 2004
|
|
EXTENSIONS
|
Values through a(72) verified by [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Apr 16 2009]
|
|
|
Search completed in 0.002 seconds
|
