The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A081728 Length of periods of Euler numbers modulo prime(n). 0
 1, 2, 2, 6, 10, 6, 8, 18, 22, 14, 30, 18, 20, 42, 46, 26, 58, 30, 66, 70, 36, 78, 82, 44, 48, 50, 102, 106, 54, 56, 126, 130, 68, 138, 74, 150, 78, 162, 166, 86, 178, 90, 190, 96, 98, 198, 210, 222, 226, 114, 116, 238, 120, 250, 128, 262, 134, 270, 138, 140, 282, 146 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS As proved by Kummer, if the actual signed Euler numbers (A122045) are used, then the period is prime(n)-1 for n>1. - T. D. Noe, Mar 16 2007 LINKS FORMULA a(n)=prime(n)-1 if prime(n) == 2 or 3 (mod 4) EXAMPLE A000364 modulo 5=prime(3) gives : 1,1,0,1,0,1,0,1,0,1,0,... with period (1,0) of length 2, hence a(3)=2. MATHEMATICA f[n_] := Block[{p = Prime[n], t, d = Divisors[p - 1], dk, k = 1}, t = Mod[Table[Abs@EulerE[2i], {i, 2, p}], p]; While[dk = d[[k]]; Nand @@ Equal @@@ Partition[Partition[t, dk], 2, 1], k++ ]; dk]; Array[f, 63] (* Ray Chandler, Mar 15 2007 *) CROSSREFS Cf. A000364, A045326, A080148. Sequence in context: A207975 A321623 A077063 * A197218 A080460 A080456 Adjacent sequences:  A081725 A081726 A081727 * A081729 A081730 A081731 KEYWORD nonn AUTHOR Benoit Cloitre, Apr 06 2003 EXTENSIONS More terms from John W. Layman, Jul 29 2005 Extended by Ray Chandler, Mar 15 2007 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.

Last modified January 19 18:25 EST 2020. Contains 331051 sequences. (Running on oeis4.)