login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086144 a(n) = 2*A071640(n) - n. 3
1, 0, 1, 2, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 3, 4, 5, 6, 5, 6, 5, 4, 5, 6, 5, 4, 3, 2, 3, 2, 1, 2, 3, 2, 3, 4, 5, 6, 7, 6, 7, 6, 7, 8, 7, 6, 5, 6, 7, 6, 7, 8, 9, 10, 9, 10, 9, 8, 7, 8, 9, 8, 9, 8, 7, 6, 7, 8, 9, 8, 9, 10, 11, 10, 9, 10, 11, 10, 9, 8, 9, 10, 11, 10, 11, 10, 11, 12, 13, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
It is conjectured that A071640(n)/n -> 1/2. - Benoit Cloitre
a(6671) < 0. - Peter Luschny, Oct 05 2011
LINKS
MAPLE
A086144 := proc(n) option remember; if n=1 then 1 else
if combinat[numbpart](n) mod 2 = 1 then 1 else -1 fi;
% + A086144(n-1) fi end: seq(A086144(i), i=1..90); # Peter Luschny, Oct 05 2011
MATHEMATICA
a071640[n_] := Sum[Mod[PartitionsP[i], 2], {i, 1, n}];
a[n_] := 2 a071640[n] - n;
Array[a, 100] (* Jean-François Alcover, Jun 11 2019 *)
PROG
(PARI) a(n) = my(x='x+O('x^(n+1)), p = 1/eta(x)); sum(i=1, n, (1-(-1)^(polcoeff(p, i)))) - n; \\ Michel Marcus, Jun 11 2019
CROSSREFS
Sequence in context: A280913 A035343 A017880 * A131974 A181975 A062406
KEYWORD
sign
AUTHOR
Benoit Cloitre, Sep 06 2003
EXTENSIONS
Erroneous data for n>55 replaced, keyword sign added by Peter Luschny, Oct 05 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 2 21:21 EDT 2024. Contains 372203 sequences. (Running on oeis4.)