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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088225 Solutions to x^n == 7 mod 11. 0
2, 6, 7, 8, 13, 17, 18, 19, 24, 28, 29, 30, 35, 39, 40, 41, 46, 50, 51, 52, 57, 61, 62, 63, 68, 72, 73, 74, 79, 83, 84, 85, 90, 94, 95, 96, 101, 105, 106, 107, 112, 116, 117, 118, 123, 127, 128, 129, 134, 138, 139, 140, 145, 149, 150, 151, 156, 160, 161, 162, 167, 171 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Primitive roots of 11. The first differences are periodic: 4,1,1,5,4,1,1,5,4,1,1,5..... - Paolo P. Lava (paoloplava(AT)gmail.com), Feb 29 2008

REFERENCES

E. Grosswald, Topics From The Theory of Numbers, 1966, pp. 62-63.

FORMULA

a(n)=-4+Sum_{k=0..n}{(1/24)*[11*(k mod 4)+29*((k+1) mod 4)+17*((k+2) mod 4)-13*((k+3) mod 4)]}, with n>=1 - Paolo P. Lava (paoloplava(AT)gmail.com), Feb 29 2008

EXAMPLE

2^7 - 7 = 121 = 11*11. Thus 2 is in the sequence.

13^7 - 7 = 11*5704410. Thus 13 is in the sequence.

PROG

(PARI) conxkmap(a, p, n) = { for(x=1, n, for(j=1, n, y=x^j-a; if(y%p==0, print1(x", "); break) ) ) }

CROSSREFS

Sequence in context: A048859 A026311 A063291 * A165775 A157671 A196747

Adjacent sequences:  A088222 A088223 A088224 * A088226 A088227 A088228

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Nov 03 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.