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.

A268710 Number of iterations of A268395 needed to reach zero from 2^n + 1: a(n) = A268708(2^n + 1).

Original entry on oeis.org

1, 2, 3, 4, 6, 9, 15, 25, 41, 75, 134, 246, 428, 802, 1454, 2643, 4588, 8851, 16849, 32368, 60504, 117343
Offset: 0

Views

Author

Antti Karttunen, Feb 11 2016

Keywords

Crossrefs

Programs

Formula

a(n) = A268708((2^n)+1).