|
Search: id:A165258
|
|
|
| A165258 |
|
Minimum value such that n occurs a(n) times, subject to the constraint that gcd(n,a(n)) = 1. |
|
+0
1
|
|
| 1, 3, 2, 3, 2, 5, 2, 5, 4, 7, 4, 7, 4, 9, 8, 9, 6, 11, 6, 9, 8, 9, 6, 11, 6, 11, 8, 11, 6, 13, 8, 13, 8, 13, 12, 13, 10, 15, 10, 17, 10, 17, 10, 15, 14, 15, 10, 17, 10, 17, 10, 15, 12, 17, 12, 15, 14, 15, 12, 17, 12, 15, 16, 15, 12, 19, 12, 19, 14, 19, 14, 19, 14, 19, 14, 21, 16, 19, 14
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
PROGRAM
|
(PARI) count(v, t, n)=local(r); for(i=1, n, if(v[i]==t, r++)); r
nexta(v, n)=for(i=1, n-1, if(gcd(i, n)==1&&count(v, i, n-1)<v[i], return(i)))
v=vector(100); v[1]=1; v[2]=3; for(n=3, 100, v[n]=nexta(v, n)); v
|
|
CROSSREFS
|
Cf. A001462, A116548.
Sequence in context: A084117 A116895 A134267 this_sequence A092962 A112924 A153092
Adjacent sequences: A165255 A165256 A165257 this_sequence A165259 A165260 A165261
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Sep 11 2009
|
|
|
Search completed in 0.002 seconds
|
