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.

A382996 a(n) is the least number k such that both k and k + s have n prime divisors, counted with multiplicity, where s is the sum of the decimal digits of k.

Table of values

n a(n)
1 11
2 15
3 18
4 81
5 243
6 486
7 2976
8 25488
9 128768
10 396864
11 911232
12 8820864
13 69940224
14 118462464
15 1171768320
16 1756943946
17 11753349120
18 272313556992
19 491737042890
20 2374758457344
21 9766784434176
22 22675979501496
23 269744252387328
24 1546075329527736
25 6138628058382336

List of values

[11, 15, 18, 81, 243, 486, 2976, 25488, 128768, 396864, 911232, 8820864, 69940224, 118462464, 1171768320, 1756943946, 11753349120, 272313556992, 491737042890, 2374758457344, 9766784434176, 22675979501496, 269744252387328, 1546075329527736, 6138628058382336]