Assistance wanted for some kind of "bumping" series

[Sean A. Irvine]

Hi,

Aitzaz Imtiaz, first year computer science student, English speaker with an Urdu background is wanting someone to assist in preparing a submission to the OEIS and/or deciding if the sequence is suitable for submission.

I believe it is based on the following:

https://math.stackexchange.com/questions/4646752/bumping-series-and-its-formula

If anyone is prepared to assist Aitzaz, I can put you in touch.

Sean.

[Aitzaz Imtiaz]

To avoid any sort of vanity here, I do not want to call it "bumping" or anything.

This is a consequence of: f(n)=\frac{(n+1) \times 2^{|n-\lceil\sqrt{n}\rceil \times(\lceil\sqrt{n}\rceil-1)-1|}}{2}

This question was also posted as a challenge on a sister network of stack exchange: https://codegolf.stackexchange.com/questions/258357/bumping-series-implementation

[Geoffrey Caveney]

The sequence described in the link can also be described as follows:

In the triangle in A062111:

Disregard the bottom row and begin with the 1 at the beginning of the second row.

Now proceed across the triangle in the following manner:

1 step to the right, then 1 step up,

then 2 steps to the right, then 2 steps up,

then 3 steps to the right, then 3 steps up, etc.

--
You received this message because you are subscribed to the Google Groups "SeqFan" group.
To unsubscribe from this group and stop receiving emails from it, send an email to seqfan+un...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CAL0FETn2DGjRoCiGRLWiHLd1feL8VdY3VEUbpKJdxVXJ%2BGK2vA%40mail.gmail.com.