Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147520
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147520 a(n) = Smallest number x such that Euler Polynomial x^2 + x + 41 is divisable by 41^n +0
3
0, 40, 1721, 139563, 14268368, 1636255182 (list; graph; listen)
OFFSET

1,2

COMMENT

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 this_sequence A143314 A060056 A140729

Adjacent sequences: A147517 A147518 A147519 this_sequence A147521 A147522 A147523

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research