|
Search: id:A064148
|
|
|
| A064148 |
|
Numbers n such that mu(n) = mu(n+1). |
|
+0 2
|
|
| 2, 8, 14, 21, 24, 27, 29, 30, 33, 34, 38, 41, 42, 44, 48, 49, 57, 63, 66, 70, 75, 78, 80, 85, 86, 93, 94, 98, 99, 101, 102, 109, 113, 116, 118, 120, 122, 124, 125, 130, 133, 135, 137, 138, 141, 142, 145, 147, 152, 158, 168, 171, 173, 175, 177, 181, 188, 190, 201
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n) seems to be asymptotic to c*n with c=3.7.... Using heuristic arguments ( cf. A074820 ) : c maybe = 1/(3A/2 + 1 - 12/pi^2) ~ 3.729994018, where A ~ 0.3226340989 is the product over all primes p of 1 - 2/p^2 (cf. A065474) - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 08 2002
|
|
PROGRAM
|
(PARI) j=[]; for(n=1, 500, if(moebius(n)==moebius(n+1), j=concat(j, n))); j
|
|
CROSSREFS
|
Adjacent sequences: A064145 A064146 A064147 this_sequence A064149 A064150 A064151
Sequence in context: A046940 A046939 A082930 this_sequence A121055 A107072 A120413
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Sep 11 2001
|
|
|
Search completed in 0.002 seconds
|