This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181451 Numbers n such that 13 is the largest prime factor of n^2-1. 2
 12, 14, 25, 27, 51, 53, 64, 79, 129, 131, 155, 181, 209, 274, 287, 337, 391, 649, 701, 703, 727, 846, 1249, 1351, 1457, 1574, 2001, 3431, 4159, 8191, 8449, 13311, 21295, 246401 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Sequence is finite and complete, for proof see A175607. Search for terms can be restricted to the range from 2 to A175607(6) = 246401; primepi(13) = 6. LINKS MATHEMATICA Select[Range[250000], FactorInteger[#^2-1][[-1, 1]]==13&] PROG (MAGMA) [ n: n in [2..250000] | m eq 13 where m is D[#D] where D is PrimeDivisors(n^2-1) ]; // Klaus Brockhaus, Feb 18 2011 (PARI) is(n)=n=n^2-1; forprime(p=2, 11, n/=p^valuation(n, p)); n>1 && 13^valuation(n, 13)==n \\ Charles R Greathouse IV, Jul 01 2013 CROSSREFS Cf. A175607, A181447-A181450, A181452-A181470, A181568. Sequence in context: A101557 A019292 A175886 * A022326 A238228 A214504 Adjacent sequences:  A181448 A181449 A181450 * A181452 A181453 A181454 KEYWORD fini,nonn,full AUTHOR Artur Jasinski, Oct 21 2010 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.