[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A058944 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A058944 Coefficients of monic irreducible polynomials over GF(3) listed in lexicographic order.
(history; published version)
#21 by Jon E. Schoenfield at Tue Dec 21 23:41:03 EST 2021
STATUS

proposed

approved

#20 by Jon E. Schoenfield at Tue Dec 21 23:40:56 EST 2021
STATUS

editing

proposed

#19 by Jon E. Schoenfield at Tue Dec 21 23:40:55 EST 2021
LINKS

Robert Israel and T. D. Noe, <a href="/A058944/b058944.txt">Table of n, a(n) for n = 1..10000</a> (n= = 1..1318 from T. D. Noe)

STATUS

approved

editing

#18 by OEIS Server at Wed Jul 06 17:48:30 EDT 2016
LINKS

Robert Israel and T. D. Noe, <a href="/A058944/b058944_1.txt">Table of n, a(n) for n = 1..10000</a> (n=1..1318 from T. D. Noe)

#17 by Bruno Berselli at Wed Jul 06 17:48:30 EDT 2016
STATUS

proposed

approved

Discussion
Wed Jul 06 17:48
OEIS Server: Installed new b-file as b058944.txt.  Old b-file is now b058944_1.txt.
#16 by Michel Marcus at Wed Jul 06 15:01:03 EDT 2016
STATUS

editing

proposed

#15 by Michel Marcus at Wed Jul 06 15:00:48 EDT 2016
REFERENCES

R. Church, Tables of irreducible polynomials for the first four prime moduli, Annals Math., 36 (1935), 198-209.

LINKS

R. Church, <a href="http://www.jstor.org/stable/1968675">Tables of irreducible polynomials for the first four prime moduli</a>, Annals Math., 36 (1935), 198-209. Church's table extends through degree 7.

EXTENSIONS

Church's table extends through degree 7.

STATUS

proposed

editing

#14 by Robert Israel at Wed Jul 06 14:27:25 EDT 2016
STATUS

editing

proposed

#13 by Robert Israel at Wed Jul 06 14:26:59 EDT 2016
LINKS

Robert Israel and T. D. Noe, <a href="/A058944/b058944_1.txt">Table of n, a(n) for n= = 1..131810000</a> (throughn=1..1318 degreefrom 8T. D. Noe)

#12 by Robert Israel at Wed Jul 06 14:24:25 EDT 2016
MAPLE

N:= 100: # to get the first N terms

count:= 0:

for d from 1 while count < N do

for nn from 0 to 3^d-1 while count < N do

L:= convert(nn, base, 3);

P:= add(L[i]*x^(i-1), i=1..nops(L))+x^d;

if Irreduc(P) mod 3 then

count:= count+1;

A[count]:= add(L[i]*10^(i-1), i=1..nops(L))+10^d;

fi

od

od:

seq(A[i], i=1..N); # Robert Israel, Jul 06 2016

STATUS

approved

editing

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 00:57 EDT 2024. Contains 375520 sequences. (Running on oeis4.)