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.

A079009 Least k such that the 2^n successive values of phi(k+j) (j=0..2^n-1) are all distinct.

Table of values

n a(n)
0 1
1 2
2 11
3 37
4 149
5 1359
6 14130
7 175327
8 1218073
9 108387730
10 14305141265

List of values

[1, 2, 11, 37, 149, 1359, 14130, 175327, 1218073, 108387730, 14305141265]