Jon Wild has authored 66 sequences. Here are the ten most recent ones:
A344488
Numbers that start a product crescendo of record length.
Original entry on oeis.org
1, 2, 3, 7, 47, 181, 1307, 2503, 40973, 46833, 109177, 2885373, 11744311, 192968969, 899988745
Offset: 1
181 is in the list because it begins a product crescendo that is longer than any beginning at any smaller number. Here is the crescendo:
1 * 181 = 181
2 * 91 = 182
3 * 61 = 183
4 * 46 = 184
5 * 37 = 185
6 * 31 = 186
11 * 17 = 187
47 * 4 = 188
63 * 3 = 189
95 * 2 = 190
191 * 1 = 191
This set of 11 products forms a longer crescendo than the previous record (which started at 47), and is the longest until the set of 13 products it is possible to write starting from 1307 (the next entry in the sequence).
Additional example: the crescendo from 2885373 (length 27) goes:
1 * 2885373 = 2885373
2 * 1442687 = 2885374
5 * 577075 = 2885375
6 * 480896 = 2885376
11 * 262307 = 2885377
19 * 151862 = 2885378
21 * 137399 = 2885379
89 * 32420 = 2885380
859 * 3359 = 2885381
1458 * 1979 = 2885382
4817 * 599 = 2885383
12437 * 232 = 2885384
19365 * 149 = 2885385
33551 * 86 = 2885386
93077 * 31 = 2885387
131154 * 22 = 2885388
221953 * 13 = 2885389
288539 * 10 = 2885390
320599 * 9 = 2885391
360674 * 8 = 2885392
412199 * 7 = 2885393
480899 * 6 = 2885394
577079 * 5 = 2885395
721349 * 4 = 2885396
961799 * 3 = 2885397
1442699 * 2 = 2885398
2885399 * 1 = 2885399
-
b(n)={if(n==1, 1, my(m=1); for(k=1, oo, fordiv(n+k, d, if(d>m, m=d; break)); if(m==n+k, return(k+1))))}
lista(lim)={my(m=0); for(n=1, lim, my(t=b(n)); if(t > m, print1(n, ", "); m=t))} \\ Andrew Howroyd, May 21 2021
A288568
Number of non-isomorphic connected arrangements of n pseudo-circles on a sphere, in the sense that the union of the pseudo-circles is a connected set, reduced for mirror symmetry.
Original entry on oeis.org
1, 1, 1, 3, 21, 984, 609423
Offset: 0
A288567
Number of connected arrangements of n circles in the affine plane, in the sense that the union of the boundaries of the circles is a connected set and every circle intersects all the other circles.
Original entry on oeis.org
1, 1, 1, 3, 21, 980
Offset: 0
A288564
Number of connected one-sided arrangements of n pseudo-circles in the affine plane, in the sense that the union of the solid pseudo-circles is a connected set.
Original entry on oeis.org
1, 1, 2, 11, 183, 30408
Offset: 0
A288563
Number of one-sided arrangements of n pseudo-circles in the affine plane.
Original entry on oeis.org
1, 1, 3, 14, 200, 30630
Offset: 0
A288565
Number of connected one-sided arrangements of n pseudo-circles in the affine plane, in the sense that the union of the boundaries of the pseudo-circles is a connected set.
Original entry on oeis.org
1, 1, 1, 6, 139, 28643
Offset: 0
A288562
Number of arrangements of n pseudo-circles in the affine plane with the property that every pseudo-circle intersects all the other circles.
Original entry on oeis.org
1, 1, 1, 4, 45, 5108, 4598809
Offset: 0
A288561
Number of connected arrangements of n pseudo-circles in the affine plane, in the sense that the union of the boundaries of the pseudo-circles is a connected set.
Original entry on oeis.org
1, 1, 6, 112, 15528
Offset: 0
A288560
Number of connected arrangements of n pseudo-circles in the affine plane, in the sense that the union of the solid pseudo-circles is a connected set.
Original entry on oeis.org
1, 1, 2, 11, 156, 16782
Offset: 0
A288559
Number of arrangements of n pseudo-circles in the affine plane.
Original entry on oeis.org
1, 1, 3, 14, 173, 16977, 17552169
Offset: 0
Comments