id:A075695 - OEIS Search Results

Search: id:A075695

Displaying 1-1 of 1 results found.

page 1

a(1)=1, then "jump over second next prime": a(n) = 2*nextprime(nextprime(a(n-1)))-a(n-1).

+0
4

1, 5, 17, 29, 45, 61, 81, 97, 109, 145, 157, 177, 185, 201, 245, 269, 285, 329, 345, 353, 381, 397, 421, 445, 469, 505, 537, 557, 581, 605, 621, 661, 693, 725, 741, 761, 785, 809, 833, 873, 889, 933, 949, 985, 1009, 1029, 1037, 1061, 1077, 1105, 1129, 1177 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The rule "jump over next smth" can be varied. In the A075694 the simplest example: "jump over next prime" is given.`
	FORMULA	`a(1)=1, a(n) = 2*nextprime(nextprime(a(n-1)))-a(n-1).`
	EXAMPLE	`a(1)=1; next second prime (second smallest larger than a(1))=3; "jump over" it: 3+(3-1)=5; a(2)=5; next second prime (second smallest larger than a(2))=11; "jump over" it: 11+(11-5)=17.`
	MAPLE	`a(1) := 1; a(n)=2*nextprime(nextprime(a(n-1)))-a(n-1);`
	CROSSREFS	`Cf. A075694.` `Sequence in context: A074965 A071695 A027703 this_sequence A034937 A024351 A086523` `Adjacent sequences: A075692 A075693 A075694 this_sequence A075696 A075697 A075698`
	KEYWORD	`easy,nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), Sep 26 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research