Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054906
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054906 Smallest number x such that Sigma[x+2n]=Sigma[x]+2n (first definition). +0
5
3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 7, 5, 3, 3, 7, 5, 3, 5, 3, 3, 5, 3, 7, 5, 3, 7, 5, 3, 3, 7, 5, 3, 5, 3, 3, 7, 5, 3, 5, 3, 7, 5, 3, 13, 7, 5, 3, 5, 3, 3, 5, 3, 3, 5, 3, 19, 13, 11, 13, 7, 5, 3, 5, 3, 7, 5, 3, 3, 11, 11, 7, 5, 3, 3, 7, 5, 3, 7, 5, 3, 5, 3, 7, 5, 3, 7, 5, 3, 3, 11, 11, 7, 5, 3, 3, 5, 3, 3, 13 (list; graph; listen)
OFFSET

1,1

COMMENT

Least (prime) solutions for Phi[x+2n]=Phi[x]+2n seems to be identical to this sequence, while prime solutions are indeed identical to this sequence.

2nd definition = smallest number x such that Phi[x+2n]=Phi[x]+2n. 3rd definition = smallest primes p such that p+2n=q prime (A020483). The 3 definitions are or conjectured to be identical.

The definitions are not identical if we do not take the smallest numbers. These smallest solutions are believed to be always prime numbers.

REFERENCES

Sivaramakrishnan,R.(1989):Classical Theory of Arithmetical Functions. Marcel Dekker,Inc., New York.

FORMULA

p=a(n) is the least prime so that p+2n is also a prime (2nd definition).

Minimal solutions to A000203[x+2n]=A000203[x]+2n or to A000010[x+2n]=A000010[x]+2n or to p+2n=q; p, q primes, a(n)=p.

EXAMPLE

n-th primes 2,3,5,7,11,13, are solutions to sigma[x+2n]=2n+sigma[x] at 2n=2,6,22,116,88.

CROSSREFS

Cf. A023200-A023203, A015913-A015917, A000203, A000010, A020483.

Sequence in context: A003569 A066670 A013606 this_sequence A020483 A138479 A136019

Adjacent sequences: A054903 A054904 A054905 this_sequence A054907 A054908 A054909

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 23 2000

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research