A120245 -id:A120245 - cp's OEIS frontend

A120244 a(1) = 1. a(m(m+1)/2 + k) = a(m) + k, 1 <= k <= m+1, m >= 1.

1, 2, 3, 3, 4, 5, 4, 5, 6, 7, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 10, 11, 12, 5, 6, 7, 8, 9, 10, 11, 12, 6, 7, 8, 9, 10, 11, 12, 13, 14, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 6, 7, 8, 9, 10, 11, 12

Offset: 1

Leroy Quet, Jun 12 2006

Kevin Ryde, Table of n, a(n) for n = 1..10011
Kevin Ryde, PARI/GP Code

Cf. A120245, A120246.

PARI
```
\\ See links.
```

Extended by Ray Chandler, Jun 19 2006

A120246 a(1) = 1. a(m(m+1)/2 + k) = m + a(k), 1 <= k <= m+1, m >= 1.

Original entry on oeis.org

1, 2, 3, 3, 4, 5, 4, 5, 6, 6, 5, 6, 7, 7, 8, 6, 7, 8, 8, 9, 10, 7, 8, 9, 9, 10, 11, 10, 8, 9, 10, 10, 11, 12, 11, 12, 9, 10, 11, 11, 12, 13, 12, 13, 14, 10, 11, 12, 12, 13, 14, 13, 14, 15, 15, 11, 12, 13, 13, 14, 15, 14, 15, 16, 16, 15, 12, 13, 14, 14, 15, 16, 15, 16, 17, 17, 16, 17, 13

Offset: 1

Leroy Quet, Jun 12 2006

When calculating a(n) using the recurrence, the number of steps to reach a(1) is A057945(n-1). - Kevin Ryde, Aug 23 2022

Kevin Ryde, Table of n, a(n) for n = 1..10011
Kevin Ryde, PARI/GP Code

Cf. A120244, A120245, A057945.

PARI
```
\\ See links.
```

Extended by Ray Chandler, Jun 19 2006

cp's OEIS Frontend

A120244 a(1) = 1. a(m(m+1)/2 + k) = a(m) + k, 1 <= k <= m+1, m >= 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Extensions