Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134671
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134671 Primes of the form 2m*691 - 1. +0
3
1381, 5527, 8291, 12437, 22111, 29021, 30403, 34549, 37313, 42841, 51133, 53897, 58043, 62189, 70481, 92593, 96739, 105031, 120233, 134053, 145109, 167221, 179659, 182423, 186569, 187951, 192097, 194861, 212827, 216973, 233557, 281927 (list; graph; listen)
OFFSET

1,1

COMMENT

Note that all zeros of A046694(n) have the indices equal to the terms of all arithmetic progressions of the type k*p, where primes p belong to a(n). Thus A046694( k*a(n) ) = 0 for all integer k>0.

LINKS

Eric Weisstein Link to a section of The World of Mathematics. Ramanujan's Tau Function.

EXAMPLE

a(1) = 1381 = 2*691 - 1 is a first prime of the form 2m*691 - 1.

MATHEMATICA

Select[ 2*691*Range[ 1000 ] - 1, PrimeQ[ # ] & ]

CROSSREFS

Cf. A046694 = Ramanujan tau numbers mod 691 = sum of 11-th power of divisors mod 691. Cf. A121733 = Numbers n such that two consecutive Ramanujan tau numbers are congruent mod 691. Cf. A121734 = Ramanujan tau numbers such that A000594[n] == A000594[n+1] mod 691. Cf. A121742 = Numbers n such that three consecutive Ramanujan tau numbers are congruent mod 691. Cf. A121743 = Values of the Ramanujan tau triplets mod 691 such that three consecutive Ramanujan tau numbers are congruent mod 691. Cf. A134670 = Least number k such that A046694 has a string of n consecutive zeros atarting with A046694(k).

Adjacent sequences: A134668 A134669 A134670 this_sequence A134672 A134673 A134674

Sequence in context: A139667 A031796 A020406 this_sequence A134670 A092128 A029819

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 05 2007

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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research