cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A382822 If a(n-1) is odd, then a(n) is the smallest even integer not yet in the sequence; if a(n-1) is even, then a(n) = a(n-1)/2 if this number is not in the sequence, otherwise a(n) = 3*a(n-1)/2; a(1)=1.

Original entry on oeis.org

1, 2, 3, 4, 6, 9, 8, 12, 18, 27, 10, 5, 14, 7, 16, 24, 36, 54, 81, 20, 30, 15, 22, 11, 26, 13, 28, 42, 21, 32, 48, 72, 108, 162, 243, 34, 17, 38, 19, 40, 60, 90, 45, 44, 66, 33, 46, 23, 50, 25, 52, 78, 39, 56, 84, 126, 63, 58, 29, 62, 31, 64, 96, 144, 216, 324, 486, 729, 68, 102, 51, 70, 35, 74, 37, 76, 114, 57
Offset: 1

Views

Author

Enrique Navarrete, Apr 15 2025

Keywords

Comments

Less repetitive than A350877 (the Sisyphus sequence); presumably a permutation of the positive integers.
Fixed points are 1, 2, 3, 4, 20, 38, 40, 44, 58, 74, 76, 86, 88, 92, 106, ,,., which, aside from 3, all seem to be even.
Largest runs of even terms seem to be of length 6, the first one of which appears at a(62)=64.

Crossrefs

Cf. A350877.