[seqfan] Re: less?

jnthn stdhr jstdhr at gmail.com
Tue Dec 17 16:30:01 CET 2019


A330520
On Dec 17, 2019 4:42 AM, "Neil Sloane" <njasloane at gmail.com> wrote:

> I agree with Sean.  go ahead and submit it.  of course there is a simple
> formula, but still, we should have it
> Best regards
> Neil
>
> Neil J. A. Sloane, President, OEIS Foundation.
> 11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
> Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
> Phone: 732 828 6098; home page: http://NeilSloane.com
> Email: njasloane at gmail.com
>
>
>
> On Tue, Dec 17, 2019 at 2:26 AM Sean A. Irvine <sairvin at gmail.com> wrote:
>
> > Yes please add this,  I too am surprised that it is not already present.
> >
> >
> > On Tue, 17 Dec 2019 at 20:09, jnthn stdhr <jstdhr at gmail.com> wrote:
> >
> > > Hi all.
> > >
> > > If I haven't made some tremendously boneheaded mistake, I'm a bit
> > surprised
> > > this sequence isn't in the db, so I can't decide if it should be added,
> > or
> > > if it's an example of one deserving of the keyword less.
> > >
> > > a(n) is the sum of the even positive integers less than or equal to n
> > times
> > > the sum of the odd positive integers less than or equal to n.
> > >
> > > Assuming the null set has a value of zero, this is:
> > >
> > > 0,0,2,8,24,54,108,192,...
> > >
> > > Many sequences are related, of course.  Superseeker doesn't find this
> > exact
> > > sequence, but lists many transformations that match.
> > >
> > > -First differences for n>=2,  = A5996.
> > >
> > > -For even n, a(n) = A179824.
> > >
> > > -For odd n, a(n) = A085537.
> > >
> > > -a(n)/2 = A007009.
> > >
> > > And more.
> > >
> > > Should I add this?
> > >
> > > P.S.
> > > This is the number of crossings if one draws n parallel lines
> > perpendicular
> > > to the previous number of lines.
> > >
> > > --
> > > Seqfan Mailing list - http://list.seqfan.eu/
> > >
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>



More information about the SeqFan mailing list