id:A075402 - OEIS Search Results

Search: id:A075402

Displaying 1-1 of 1 results found.

page 1

Smallest number such that a(n) + T(n) is a prime, where T(n) is the n-th triangular number.

+0
2

1, 0, 1, 1, 2, 2, 1, 1, 2, 4, 1, 1, 6, 2, 7, 1, 4, 2, 1, 1, 2, 4, 1, 7, 6, 2, 1, 3, 4, 2, 3, 13, 2, 4, 1, 7, 6, 2, 7, 1, 2, 4, 1, 1, 4, 6, 1, 5, 4, 2, 1, 3, 2, 2, 3, 1, 4, 10, 7, 1, 10, 20, 1, 1, 8, 2, 3, 1, 2, 18, 1, 5, 6, 2, 1, 1, 8, 2, 3, 11, 2, 4, 5, 1, 4, 20, 5, 1, 2, 4, 15, 5, 2, 16, 1, 1, 6, 10, 1 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`0 occurs only once in this sequence.`
	PROGRAM	`(PARI) for(n=1, 100, a=n*(n+1)/2:print1(nextprime(a)-a", "))`
	CROSSREFS	`Cf. A075403.` `Sequence in context: A156282 A120423 A113137 this_sequence A088855 A034851 A122085` `Adjacent sequences: A075399 A075400 A075401 this_sequence A075403 A075404 A075405`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 23 2002`
	EXTENSIONS	`Corrected and extended by Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 19 2003`

page 1

Search completed in 0.002 seconds

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.

AT&T Labs Research