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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024715 a(n) = residue mod 11 of n-th term of A024702. 1
1, 2, 5, 7, 1, 4, 0, 2, 7, 2, 4, 0, 4, 7, 2, 1, 0, 1, 2, 7, 1, 0, 7, 7, 2, 4, 0, 4, 1, 0, 1, 2, 1, 4, 4, 7, 7, 4, 4, 1, 2, 1, 0, 0, 7, 4, 2, 7, 7, 4, 0, 7, 2, 0, 1, 2, 7, 1, 4, 2, 0, 4, 1, 7, 0, 2, 1, 4, 0, 2, 2, 0, 1, 7, 2, 0, 1, 7, 0, 4, 7, 2, 0, 4, 7, 1, 0, 0, 1, 1, 4, 2, 2, 4, 4, 2, 1, 7, 4, 2, 7, 4, 0, 1, 2, 0, 1, 2, 7, 4, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,2

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 3..10000

PROG

(PARI) a(n)=prime(n)^2\24%11 \\ Charles R Greathouse IV, May 31 2013

CROSSREFS

Sequence in context: A021393 A181583 A010589 * A024709 A101245 A004576

Adjacent sequences:  A024712 A024713 A024714 * A024716 A024717 A024718

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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

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

Last modified December 19 20:59 EST 2014. Contains 252239 sequences.