A339092 Number of steps needed for a(1) = k ("the seed") to reappear in the sequence under the A339091 protocol, for k = 1, 2, 3, 4, ... to n. Else -1 if the seed never reappears.

2, 3, 2, 3, 2, 3, 2, 3, 2, -1, -1, -1, -1, 13, -1, -1, -1, 5, -1, -1, -1, 9, 12, 16, 14, -1, -1, -1, -1, -1, -1, 17, 18, -1, -1, -1, -1, 20, -1, 13, 20, -1, -1, -1, -1, -1, -1, 22, 18, -1, -1, 19, -1, -1, -1, -1, -1, -1, 28, -1, -1, 32, -1, -1, 24, -1, -1, -1, -1, -1, -1, 22, -1, -1, -1, -1, 30, -1, -1, -1, -1, 28

Offset

1,1

Comments

A339091 explains how a(1) = k ("the seed") generates a sequence.

Links

Carole Dubois, Table of n, a(n) for n = 1..20000

Example

The seed 1 generates another 1 at step #2 under the A339091 protocol; thus a(1) = 2;
The seed 2 generates another 2 at step #3 under the A339091 protocol; thus a(2) = 3;
The seed 3 generates another 3 at step #2 under the A339091 protocol; thus a(3) = 2;
The seed 4 generates another 4 at step #3 under the A339091 protocol; thus a(4) = 3;
The seed 10 doesn't generate any 10 under the A339091 protocol; thus a(10) = -1;
The seed 14 generates another 14 at step #13 under the A339091 protocol; thus a(14) = 13; etc.

Crossrefs

Cf. A339091 (the protocol), A339093 (the "sterile" seeds producing -1); A339111 (the "fertile" seeds).

Sequence in context: A274821 A275720 A307200 * A165587 A368405 A356464

Adjacent sequences: A339089 A339090 A339091 * A339093 A339094 A339095

Keyword

base,sign

Author

Eric Angelini and Carole Dubois, Nov 23 2020

Status

approved