Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036454
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036454 Prime powers with special exponents: q^(p-1) where both p and q are arbitrary prime numbers. +0
5
4, 9, 16, 25, 49, 64, 81, 121, 169, 289, 361, 529, 625, 729, 841, 961, 1024, 1369, 1681, 1849, 2209, 2401, 2809, 3481, 3721, 4096, 4489, 5041, 5329, 6241, 6889, 7921, 9409, 10201, 10609, 11449, 11881, 12769, 14641, 15625, 16129, 17161, 18769, 19321 (list; graph; listen)
OFFSET

1,1

COMMENT

Composite numbers with a prime number of divisors.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

Nest[ d, a[ n ], 2 ]=2 or d[ d[ a[ n ] ] ]=2, where d[ x ]=tau[ x ]=sigma[ 0, x ], the number of divisors of x.

EXAMPLE

From powers of 2 4,16,64,1024,4096,65536 are in the sequence since exponent+1 is also prime. The same powers of any prime base also included.. d[ a[ n ] ]=p-1+1=p and d[ d[ [ a[ n ] ] ]=2 already stationary.

PROGRAM

(PARI) for(n=1, 34000, if(isprime(n), n++, x=numdiv(n); if(isprime(x), print(n))))

CROSSREFS

Cf. A000005, A036450, A036452, A010553.

Cf. A009087

Sequence in context: A075494 A063735 A056798 this_sequence A115648 A082522 A133900

Adjacent sequences: A036451 A036452 A036453 this_sequence A036455 A036456 A036457

KEYWORD

nonn,easy,nice

AUTHOR

Labos E. (labos(AT)ana.sote.hu)

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research