Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137467
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137467 For n >=3, n = p(i)+p(j)-p(k), p(i),p(j),p(k) distinct primes and i+j-k=minimum. Then a(n) = i + j - k. +0
1
1, 2, 3, 2, 3, 3, 4 (list; graph; listen)
OFFSET

3,2

COMMENT

Is it true for all n : n = p(i)+ p(j)-p(k) ?

FORMULA

For n >=3, n = p(i)+p(j)-p(k), p(i),p(j),p(k) distinct primes and i+j-k=minimum. Then a(n) = i + j - k

EXAMPLE

n=6; 6=p(1)+p(5)-p(4) =2+11-7; a(6)= 1+5-4 = 2

CROSSREFS

Cf. A000040, A038134.

Adjacent sequences: A137464 A137465 A137466 this_sequence A137468 A137469 A137470

Sequence in context: A102351 A078173 A129759 this_sequence A078627 A106370 A128630

KEYWORD

easy,nonn,uned

AUTHOR

Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Apr 19 2008

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 October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research