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.

A332895 a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A332893(n)) + [n == 1 (mod 4)].

Original entry on oeis.org

0, 1, 2, 2, 5, 4, 10, 4, 5, 10, 42, 8, 21, 20, 8, 8, 85, 10, 170, 20, 21, 84, 682, 16, 11, 42, 8, 40, 341, 16, 2730, 16, 85, 170, 16, 20, 1365, 340, 40, 40, 5461, 42, 10922, 168, 17, 1364, 43690, 32, 23, 22, 168, 84, 21845, 16, 80, 80, 341, 682, 174762, 32, 87381, 5460, 40, 32, 43, 170, 699050, 340, 1365, 32, 2796202
Offset: 1

Views

Author

Antti Karttunen, Mar 04 2020

Keywords

Crossrefs

Programs

Formula

a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A332893(n)) + [n == 1 (mod 4)].
For n > 1, a(2n) = 2*a(n).
For n >= 1, a(A108546(n)) = A000975(n); A000120(a(n)) = A332897(n).