id:A083237 - OEIS Search Results

Search: id:A083237

Displaying 1-1 of 1 results found.

page 1

First order recursion: f[0]=5; f[n]=p(n)-f[n-1]; Same function as in A083236 but initial value = 5.

+0
3

-3, 6, -1, 8, 3, 10, 7, 12, 11, 18, 13, 24, 17, 26, 21, 32, 27, 34, 33, 38, 35, 44, 39, 50, 47, 54, 49, 58, 51, 62, 65, 66, 71, 68, 81, 70, 87, 76, 91, 82, 97, 84, 107, 86, 111, 88, 123, 100, 127, 102, 131, 108, 133, 118, 139, 124, 145, 126, 151, 130, 153, 140, 167, 144, 169, 148, 183, 154, 193, 156, 197, 162, 205, 168, 211, 172 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`Same implicit relationship:a[n-1]+a[n]=p(n), the n-th prime;` `It follows also that A001223(n)=a(n+1)-a(n-1)!`
	MATHEMATICA	`RecursionLimit$=10000; f[x_] := Prime[x]-f[x-1]; f[0]=5; Table[f[w], {w, 1, 100}]`
	CROSSREFS	`Cf. A000040, A001223.` `Sequence in context: A065233 A072452 A096602 this_sequence A118948 A118012 A022836` `Adjacent sequences: A083234 A083235 A083236 this_sequence A083238 A083239 A083240`
	KEYWORD	`sign`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Apr 23 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research