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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218356 Minimal order of degree-n irreducible polynomials over GF(3). 3
1, 4, 13, 5, 11, 7, 1093, 32, 757, 44, 23, 35, 797161, 547, 143, 17, 1871, 19, 1597, 25, 14209, 67, 47, 224, 8951, 398581, 109, 29, 59, 31, 683, 128, 299, 103, 71, 95, 13097927, 2851, 169, 352, 83, 43, 431, 115, 181, 188, 1223, 97, 491, 151, 12853, 53, 107 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) < 3^n.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..100

FORMULA

a(n) = min(M(n)) with M(n) = {d : d|(3^n-1)} \ U(n-1) and U(n) = M(n) union U(n-1) for n>0, U(0) = {}.

a(n) = A212906(n,1) = A213224(n,2).

MAPLE

M:= proc(n) M(n):= divisors(3^n-1) minus U(n-1) end:

U:= proc(n) U(n):= `if`(n=0, {}, M(n) union U(n-1)) end:

a:= n-> min(M(n)[]):

seq (a(n), n=1..60);

CROSSREFS

Cf. A212906, A213224.

Sequence in context: A170865 A320030 A191509 * A249120 A170844 A051432

Adjacent sequences:  A218353 A218354 A218355 * A218357 A218358 A218359

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Oct 27 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 19:27 EST 2019. Contains 329987 sequences. (Running on oeis4.)