id:A022831 - OEIS Search Results

Search: id:A022831

Displaying 1-1 of 1 results found.

page 1

a(n) = c(1)p(1)+...+c(n)p(n), where c(i) = 1 if a(i-1) >= p(i) and c(i) = -1 if a(i-1) < p(i), for i = 1,...,n (p(i) = primes).

+0
2

2, 5, 10, 3, 14, 1, 18, 37, 14, 43, 12, 49, 8, 51, 4, 57, 116, 55, 122, 51, 124, 45, 128, 39, 136, 35, 138, 31, 140, 27, 154, 23, 160, 21, 170, 19, 176, 13, 180, 7, 186, 5, 196, 3, 200, 1, 212, 435, 208, 437, 204, 443, 202, 453, 196, 459, 190, 461, 184 (list; graph; listen)

	OFFSET	`0,1`
	LINKS	`Index entries for sequences related to Recaman's sequence`
	CROSSREFS	`Sequence in context: A125974 A059955 A099796 this_sequence A064365 A078322 A126842` `Adjacent sequences: A022828 A022829 A022830 this_sequence A022832 A022833 A022834`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research