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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073170 a(1) = a(2) = 1; for n>2, a(n) = prime(n-1)-n+1. 0
0, 0, 1, 2, 3, 6, 7, 10, 11, 14, 19, 20, 25, 28, 29, 32, 37, 42, 43, 48, 51, 52, 57, 60, 65, 72, 75, 76, 79, 80, 83, 96, 99, 104, 105, 114, 115, 120, 125, 128, 133, 138, 139, 148, 149, 152, 153, 164, 175, 178, 179, 182, 187, 188, 197, 202, 207, 212, 213, 218, 221 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

Smallest x such that A002808(x)-x (cf. A073169) equals n, or 0 if no such value exists.

FORMULA

a(n)=Min{x; composite[x]-x=n}

MATHEMATICA

f[x_] := FixedPoint[x+PrimePi[ # ]+1&, x] t=Table[0, {100}]; Do[s=f[n]-n; If[s<101&&t[[s]]==0, t[[s]]=n], {n, 1, 10000}]; t

CROSSREFS

Cf. A002808, A073168, A073169. Essentially same sequence as A014689.

Cf. A000040, A014689.

Sequence in context: A042964 A062837 A190670 * A014689 A117206 A026443

Adjacent sequences:  A073167 A073168 A073169 * A073171 A073172 A073173

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 19 2002

EXTENSIONS

Simpler description from Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 29 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 07:41 EST 2012. Contains 205998 sequences.