Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081727
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081727 Length of periods of Euler numbers modulo n. +0
2
1, 1, 2, 1, 2, 2, 6, 4, 6, 2, 10, 2, 6, 6, 2, 8, 8, 6, 18, 2, 6, 10, 22, 4, 10, 6, 18, 6, 14, 2, 30, 16, 10, 8, 6, 6, 18, 18, 6, 4 (list; graph; listen)
OFFSET

1,3

FORMULA

a(n)=n-1 if n=2, 3, 7, 11, 19, 23, 31...is a prime == 2 or 3 (mod 4) (A045326)

EXAMPLE

A000364 modulo 5 gives : 1,1,0,1,0,1,0,1,0,1,0,... with period (1,0) of length 2, hence a(5)=2.

CROSSREFS

Cf. A000364, A045326.

Sequence in context: A093659 A067541 A054706 this_sequence A000020 A077014 A093655

Adjacent sequences: A081724 A081725 A081726 this_sequence A081728 A081729 A081730

KEYWORD

more,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 06 2003

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