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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167505 Number of primes of the form 2^(n-m) 3^m + 1, 0 <= m <= n. 3
1, 2, 2, 2, 3, 2, 3, 4, 4, 3, 2, 0, 5, 1, 1, 6, 6, 2, 5, 1, 1, 2, 5, 0, 3, 1, 2, 2, 4, 2, 5, 3, 0, 1, 6, 2, 8, 2, 2, 3, 9, 1, 7, 4, 4, 0, 6, 0, 3, 3, 2, 7, 8, 1, 4, 4, 1, 2, 6, 0, 5, 2, 4, 2, 2, 1, 11, 4, 3, 1, 3, 0, 6, 0, 2, 3, 4, 1, 6, 0, 4, 3, 8, 2, 2, 2, 2, 1, 3, 1, 2, 3, 3, 1, 3, 0, 5, 1, 2, 1, 7, 0, 7, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..105.

M. Underwood, 2^a*3^b one away from a prime. Post to primenumbers group, Nov. 19, 2009.

PROG

(PARI) A167505(n)=sum(b=0, n, ispseudoprime(3^b<<(n-b)+1))

CROSSREFS

Cf. A167504, A167506.

Sequence in context: A253893 A289437 A068324 * A165015 A178994 A306608

Adjacent sequences:  A167502 A167503 A167504 * A167506 A167507 A167508

KEYWORD

nonn

AUTHOR

M. F. Hasler, Nov 19 2009

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 18 19:00 EDT 2019. Contains 325144 sequences. (Running on oeis4.)