Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152008
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152008 Primes which are divisors of numbers of the form (2^EulerPhi[3^k]-1)/3^k +0
2
7, 19, 73, 163, 487, 1459, 2593, 17497, 39367, 52489, 71119, 80191, 87211, 97687, 135433, 139483, 209953, 262657, 379081 (list; graph; listen)
OFFSET

1,1

COMMENT

The primes in this sequence have the property that with the exception of 7 they are congruent to 1 mod 18 and with the exception of 7, 19, 73 are congruent to 1 mod 54.

MATHEMATICA

a = {}; Do[k = ((2^EulerPhi[3^(w + 1)] - 1)/3^(w + 1))/((2^EulerPhi[3^w] - 1)/3^w); Do[If[Mod[k, Prime[n]] == 0, AppendTo[a, Prime[n]]; Print[Prime[n]]], {n, PrimePi[2], PrimePi[379081]}], {w, 1, 20}]; Union[a] (*Artur Jasinski*)

CROSSREFS

Cf. A008776, A152007

Sequence in context: A155296 A155463 A005516 this_sequence A002533 A111011 A144723

Adjacent sequences: A152005 A152006 A152007 this_sequence A152009 A152010 A152011

KEYWORD

hard,nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Nov 19 2008

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Nov 26 2008

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 December 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research