A147520 -id:A147520 - cp's OEIS frontend

A147521 a(n) is the smallest value of Euler polynomial x^2 + x + 41 which is divisible by 41^n.

41, 1681, 2963603, 19477970573, 203586339651833, 2677331022258108347, 40785586686127252393, 3817838920923578492820563, 22427952844519540079208409331, 3292526219739666997778171798741, 59254464597252454704406353071130683, 93363909561408736238900593787191180421

Offset: 1

Artur Jasinski, Nov 06 2008

nonn

For values x see A147520 For values (x^2 + x + 41)/(41^n) see A147522.

Cf. A145292, A145293, A145294, A147520, A147521, A147522.

a = {}; Do[x = 0; While[Mod[x^2 + x + 41, 41^n] != 0, x++ ]; AppendTo[a,x^2 + x + 41];Print[{n, x, x^2 + x + 41, (x^2 + x + 41)/41^n}], {n, 1, 6}];a

a(7)-a(12) from Hugo Pfoertner, Jan 12 2019

A147522 Minimal number such that a(n)*41^n is of the form x^2 + x + 41.

Original entry on oeis.org

1, 1, 43, 6893, 1757233, 563636267, 209420753, 478130829203, 68506995922171, 245296117830341, 107670977147002963, 4137830996824703141, 16215855859012574521, 3891295582697539371727, 20259360308241533953897, 3150687184319350782852593, 574603643148719626677940181

Offset: 1

Artur Jasinski, Nov 06 2008

nonn

For values x see A147520. For x^2 + x + 41 values see A147521.

Cf. A145292, A145293, A145294, A147520, A147521, A147522.

a = {}; Do[x = 0; While[Mod[x^2 + x + 41, 41^n] != 0, x++ ]; AppendTo[a,(x^2 + x + 41)/41^n];Print[{n, x, x^2 + x + 41, (x^2 + x + 41)/41^n}], {n, 1, 6}]; a

a(7)-a(17) from Hugo Pfoertner, Jan 12 2019

cp's OEIS Frontend

A147521 a(n) is the smallest value of Euler polynomial x^2 + x + 41 which is divisible by 41^n.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Extensions