login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290740 a(n) = A290735(n) - |A290737(n) + A290739(n)|. 4
1, 1, 1, 2, 2, 3, 4, 3, 3, 5, 5, 6, 5, 7, 6, 6, 7, 5, 7, 8, 3, 7, 9, 6, 8, 12, 7, 10, 11, 6, 9, 11, 8, 6, 15, 7, 12, 12, 9, 10, 12, 9, 12, 15, 8, 13, 16, 9, 11, 16, 6, 16, 17, 6, 12, 15, 12, 12, 19, 9, 12, 19, 9, 13, 18, 9, 15, 23, 9, 12, 17, 13, 18, 21, 12, 15, 22, 15, 12, 22, 9, 20, 23, 8, 18, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Andrews conjectures that a(n) >= 1 for all n.

LINKS

Table of n, a(n) for n=0..85.

George E. Andrews, The Bhargava-Adiga Summation and Partitions, 2016.

CROSSREFS

Cf. A008443, A290733-A290740.

Sequence in context: A330416 A054703 A048206 * A075765 A309899 A181024

Adjacent sequences:  A290737 A290738 A290739 * A290741 A290742 A290743

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Aug 10 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 06:33 EST 2020. Contains 331033 sequences. (Running on oeis4.)