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.

A276654 a(n) = the smallest number k>1 such that floor(Sum_{p|k} 0.p) = n where p runs through the prime divisors of k.

Table of values

n a(n)
0 2
1 21
2 2905
3 281785
4 47740490
5 9178864590
6 8533159052845
7 1817562878255985
8 1801204812351681135
9 787408225243814333670

List of values

[2, 21, 2905, 281785, 47740490, 9178864590, 8533159052845, 1817562878255985, 1801204812351681135, 787408225243814333670]