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.

A098515 Least m such that m and m+n are both products of exactly n primes counting multiplicity.

Table of values

n a(n)
1 1
2 2
3 4
4 27
5 36
6 675
7 810
8 12393
9 7552
10 268992
11 506240
12 6436341
13 2440692
14 290698227
15 455503986
16 4897228800
17 520575984
18 519417147375
19 124730265582
20 8961777270765
21 753891573760
22 203558860750848
23 51126160064490
24 4021771417157632
25 1305269217263592
26 69131417822953472
27 57710779788427264
28 1838459534098563045
29 63846774162325476

List of values

[1, 2, 4, 27, 36, 675, 810, 12393, 7552, 268992, 506240, 6436341, 2440692, 290698227, 455503986, 4897228800, 520575984, 519417147375, 124730265582, 8961777270765, 753891573760, 203558860750848, 51126160064490, 4021771417157632, 1305269217263592, 69131417822953472, 57710779788427264, 1838459534098563045, 63846774162325476]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.