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.

A147520 a(n) = Smallest number x such that Euler Polynomial x^2 + x + 41 is divisible by 41^n.

Table of values

n a(n)
1 0
2 40
3 1721
4 139563
5 14268368
6 1636255182
7 6386359423
8 1953929098233
9 149759650255065
10 1814531956108700
11 243422399538851918
12 9662500171353620019
13 122479951673184550424
14 12148820281768361731597
15 177497315692809432279207
16 14173382150616650630276616
17 1225594969529024683212496795

List of values

[0, 40, 1721, 139563, 14268368, 1636255182, 6386359423, 1953929098233, 149759650255065, 1814531956108700, 243422399538851918, 9662500171353620019, 122479951673184550424, 12148820281768361731597, 177497315692809432279207, 14173382150616650630276616, 1225594969529024683212496795]

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

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