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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209063 Let p = A099180(n) be the n-th prime which is greater than its reversal p'; a(n) = number of ways to write p as a multiple of p' +- q where q is a prime < p. 6
1, 2, 0, 1, 4, 3, 0, 2, 1, 1, 1, 1, 1, 1, 0, 0, 3, 2, 4, 0, 0, 2, 0, 2, 1, 3, 1, 1, 1, 1, 1, 4, 1, 4, 2, 0, 1, 2, 1, 1, 1, 2, 1, 0, 1, 1, 1, 4, 4, 1, 0, 1, 1, 2, 0, 3, 2, 0, 0, 3, 1, 3, 0, 0, 1, 3, 0, 0, 2, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Sequence is bounded - see A202286.

LINKS

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

FORMULA

A209063 = A209914 o A099180.  - M. F. Hasler, Mar 15 2012

EXAMPLE

For n=6, p = 71, p' = 17 and there are three solutions:

71 = 2*17 + 3771 = 4*17 + 371 = 6*17 - 31, so a(6) = 3.

PROG

(PARI) A209063(n)=A209914(A099180(n))  \\ - M. F. Hasler, Mar 15 2012

CROSSREFS

Cf. A099180. A202286 gives smallest m such that a(m) = n.

Sequence in context: A160648 A124912 A138752 * A098689 A264583 A158984

Adjacent sequences:  A209060 A209061 A209062 * A209064 A209065 A209066

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Mar 13 2012

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.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 27 07:41 EDT 2017. Contains 287198 sequences.