login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A268690
A268642 with a(n+1) = 5*n if ceiling(a(n)/2) is already in the sequence.
0
1, 5, 3, 2, 10, 50, 25, 13, 7, 4, 20, 100, 500, 250, 125, 63, 32, 16, 8, 40, 200, 1000, 5000, 2500, 1250, 625, 313, 157, 79, 395, 198, 99, 495, 248, 124, 62, 31, 155, 78, 39, 195, 98, 49, 245, 123, 615, 308, 154, 77
OFFSET
1,2
COMMENTS
It is conjectured that this is a permutation of the integers, along with any Seelmann sequence in which a(n+1) = M*n if the divide by 2 rule is not permitted, for any integer M>1 and not of the form M = 2^N.
CROSSREFS
Cf. A268642.
Sequence in context: A352024 A176524 A309276 * A065627 A377470 A193958
KEYWORD
nonn
AUTHOR
David Seelmann, Feb 11 2016
STATUS
approved