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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083236 First order recursion: a[0]=2; a[n]=p(n)-a[n-1]. 4
0, 3, 2, 5, 6, 7, 10, 9, 14, 15, 16, 21, 20, 23, 24, 29, 30, 31, 36, 35, 38, 41, 42, 47, 50, 51, 52, 55, 54, 59, 68, 63, 74, 65, 84, 67, 90, 73, 94, 79, 100, 81, 110, 83, 114, 85, 126, 97, 130, 99, 134, 105, 136, 115, 142, 121, 148, 123, 154, 127, 156, 137, 170, 141, 172, 145 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

Observe relationship: a[n-1]+a[n]=p(n), the n-th prime;

n=6: a[6]+a[7]=7+10=p(7)=17 and a[7]+a[8]=10+9=19=p(8);

It follows also that A001223(n)=a(n+1)-a(n-1)!

MATHEMATICA

RecursionLimit$=10000; f[x_] := Prime[x]-f[x-1]; f[0]=2; Table[f[w], {w, 1, 100}]

CROSSREFS

Cf. A000040, A001223.

Sequence in context: A153153 A175058 A154437 * A079973 A055922 A194072

Adjacent sequences:  A083233 A083234 A083235 * A083237 A083238 A083239

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 23 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 15 23:53 EST 2012. Contains 205860 sequences.