[seqfan] Re: Smallest index of Fibonacci-like sequence containing n

Heinz, Alois alois.heinz at hs-heilbronn.de
Wed Nov 5 21:51:04 CET 2014

The terms are correct.  It is easy to compute more terms.
Please submit your sequence.


Am 05.11.2014 um 19:50 schrieb Allan Wechsler:

> I have calculated A[n] by hand for n from 1 to 24. It is quite possible
> that I have made mistakes, but the sequence I get is:
> {1,1,1,2,1,2,3,1,3,2,3,4,1,4,3,2,5,3,5,4,1,6,4,3, ...}
> This is not in OEIS. I would've submitted it, but I would like somebody
> else to check my arithmetic first, because it seems unlikely that such a
> simple concept wouldn't have been entered already. If nobody steps up to
> the place quickly I will cobble together some code and submit anyway.
> Thanks for your assistance, seqfans!

More information about the SeqFan mailing list