|
Search: id:A037227
|
|
|
| A037227 |
|
If n = 2^m*k, k odd, then a(n)=2*m+1. |
|
+0
2
|
|
| 1, 3, 1, 5, 1, 3, 1, 7, 1, 3, 1, 5, 1, 3, 1, 9, 1, 3, 1, 5, 1, 3, 1, 7, 1, 3, 1, 5, 1, 3, 1, 11, 1, 3, 1, 5, 1, 3, 1, 7, 1, 3, 1, 5, 1, 3, 1, 9, 1, 3, 1, 5, 1, 3, 1, 7, 1, 3, 1, 5, 1, 3, 1, 13, 1, 3, 1, 5, 1, 3, 1, 7, 1, 3, 1, 5, 1, 3, 1, 9, 1, 3, 1, 5, 1, 3, 1, 7, 1, 3, 1, 5, 1, 3, 1, 11, 1, 3, 1, 5, 1, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
D. B. Shapiro, Problem 10456, Amer. Math. Monthly, 105 (1998), 565-566.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1024
|
|
FORMULA
|
a(n) = Sum_{d divides n} (-1)^(d+1)*mu(d)*tau(n/d). Multiplicative with a(p^e) = 2*e+1 if p = 2; 1 if p > 2. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 27 2003
a(n) = a(n-1)+(-1)^n*(a(floor(n/2))+1). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 27 2003
a(2n) = a(n) + 2, a(2n+1) = 1. a(n) = 2*A007814(n) + 1. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 07 2003
|
|
CROSSREFS
|
Cf. A001511.
Sequence in context: A134700 A085407 A016475 this_sequence A056753 A114567 A001051
Adjacent sequences: A037224 A037225 A037226 this_sequence A037228 A037229 A037230
|
|
KEYWORD
|
nonn,easy,nice,mult
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Erich Friedman (erich.friedman(AT)stetson.edu).
|
|
|
Search completed in 0.002 seconds
|
