id:A083236 - OEIS Search Results

Search: id:A083236

Displaying 1-1 of 1 results found.

page 1

First order recursion: a[0]=2; a[n]=p(n)-a[n-1].

+0
5

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; listen)

	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: A153152 A153153 A154437 this_sequence A079973 A055922 A050061` `Adjacent sequences: A083233 A083234 A083235 this_sequence A083237 A083238 A083239`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 23 2003`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research