login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A147520 a(n) = Smallest number x such that Euler Polynomial x^2 + x + 41 is divisable by 41^n 3
0, 40, 1721, 139563, 14268368, 1636255182 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

For values of x^2 + x + 41 see A147521 For values (x^2 + x + 41)/(41^n) see A147522

MATHEMATICA

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

CROSSREFS

A145292, A145293, A145294, A147520, A147521, A147522

Sequence in context: A041761 A140702 A145294 * A190926 A143314 A189503

Adjacent sequences:  A147517 A147518 A147519 * A147521 A147522 A147523

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Nov 06 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 23:16 EST 2012. Contains 205687 sequences.