|
Search: id:A061669
|
|
|
| A061669 |
|
n*(mu(n) + 1), where mu(n) is the Moebius function A008683. |
|
+0
1
|
|
| 2, 0, 0, 4, 0, 12, 0, 8, 9, 20, 0, 12, 0, 28, 30, 16, 0, 18, 0, 20, 42, 44, 0, 24, 25, 52, 27, 28, 0, 0, 0, 32, 66, 68, 70, 36, 0, 76, 78, 40, 0, 0, 0, 44, 45, 92, 0, 48, 49, 50, 102, 52, 0, 54, 110, 56, 114, 116, 0, 60, 0, 124, 63, 64, 130, 0, 0, 68, 138, 0, 0, 72, 0, 148, 75
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
EXAMPLE
|
a(5)=(5 * -1) + 5 = 0 because mu(5)= -1.
|
|
PROGRAM
|
(PARI) for(n=1, 20, print(n*moebius(n)+n))
(PARI) { for (n=1, 1000, write("b061669.txt", n, " ", n*moebius(n) + n) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 26 2009]
|
|
CROSSREFS
|
Cf. A008683.
Sequence in context: A137513 A140668 A071390 this_sequence A136334 A155039 A106235
Adjacent sequences: A061666 A061667 A061668 this_sequence A061670 A061671 A061672
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jun 16 2001
|
|
EXTENSIONS
|
More terms from Dean Hickerson (dean.hickerson(AT)yahoo.com), Jul 24, 2001
|
|
|
Search completed in 0.002 seconds
|
