A268642 -id:A268642 - cp's OEIS frontend

A268529 Records in A268642.

1, 3, 6, 18, 36, 108, 159, 180, 540, 648, 1026, 1077, 1617, 1818, 2049, 3075, 3888, 6156, 6930, 7128, 7668, 9717, 14577, 18465, 23328, 23757, 35637, 42120, 42768, 46329, 56373, 70956, 85212, 97197, 145797, 218697, 276048, 314925, 367413, 672624, 1008936

Offset: 1

N. J. A. Sloane, Feb 17 2016

nonn

Cf. A268642, A268530.

A268530 Positions of records in A268642.

Original entry on oeis.org

1, 2, 4, 5, 12, 13, 36, 41, 42, 91, 137, 168, 170, 219, 224, 226, 280, 388, 393, 424, 442, 452, 454, 464, 549, 836, 838, 936, 1073, 1652, 2797, 2913, 3528, 3807, 3809, 3811, 4550, 5209, 5413, 5849, 5851

Offset: 1

N. J. A. Sloane, Feb 17 2016

nonn

Cf. A268642, A268529.

A268531 Position of n in A268642 (or, inverse permutation to A268642).

Original entry on oeis.org

1, 3, 2, 10, 7, 4, 17, 9, 6, 27, 19, 11, 24, 16, 8, 86, 21, 5, 65, 26, 18, 57, 31, 88, 62, 23, 15, 80, 54, 28, 98, 85, 20, 46, 33, 12, 77, 64, 25, 38, 95, 82, 69, 56, 30, 113, 100, 87, 74, 61, 22, 118, 35, 14, 149, 79, 66, 53, 123, 40, 110, 97, 84, 273, 71, 58, 128, 45, 32, 203, 102, 89, 146, 76, 63

Offset: 1

N. J. A. Sloane, Feb 17 2016

nonn

Apparently there is a claim that A268642 contains every positive integer exactly once, so this sequence is well-defined.

N. J. A. Sloane, Table of n, a(n) for n = 1..945

Cf. A268642.

# Let b1 be a list of the initial terms of A268642
ans:=[];
for n from 1 to nops(b1) do
   if member(n,b1,'p') then ans:=[op(ans),p];
   else lprint("missed", n); break; fi;
od;
ans;

A268690 A268642 with a(n+1) = 5*n if ceiling(a(n)/2) is already in the sequence.

Original entry on oeis.org

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

David Seelmann, Feb 11 2016

nonn

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.

Cf. A268642.

cp's OEIS Frontend

A268529 Records in A268642.

Views

Author

Keywords

Crossrefs

A268530 Positions of records in A268642.

Views

Author

Keywords

Crossrefs

A268531 Position of n in A268642 (or, inverse permutation to A268642).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

A268690 A268642 with a(n+1) = 5*n if ceiling(a(n)/2) is already in the sequence.

Views

Author

Keywords

Comments

Crossrefs