This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 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 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: A124912 A138752 A291656 * A098689 A288515 A264583 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.