Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157197
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157197 Numbers k such that p(k) + p(k+1) + p(k+2) = A122706(n)^n, where p(k) is a k-th prime. +0
1
3, 6, 85, 20877 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(1) = 3 because p(3) + p(4) + p(5) = 5 + 7 + 11 = 23 = A122706(1)^1. a(2) = 6 because p(6) + p(7) + p(8) = 13 + 17 + 19 = 49 = 7^2 = A122706(2)^2.

CROSSREFS

Cf. A122706 = Smallest prime p such that p^n equal to the sum of 3 consecutive primes, or 1 if such a prime does not exist.

Sequence in context: A050722 A069502 A023174 this_sequence A036286 A084008 A092680

Adjacent sequences: A157194 A157195 A157196 this_sequence A157198 A157199 A157200

KEYWORD

more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 24 2009

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