id:A106033 - OEIS Search Results

Search: id:A106033

Displaying 1-1 of 1 results found.

page 1

a(n) is the least number such that n*prime(n)+a(n) is a perfect square.

+0
1

2, 3, 1, 8, 9, 3, 2, 17, 18, 34, 20, 40, 43, 23, 24, 52, 21, 58, 23, 24, 67, 26, 27, 73, 75, 78, 28, 29, 88, 91, 32, 33, 103, 35, 114, 40, 120, 47, 48, 136, 57, 142, 68, 157, 160, 62, 83, 112, 113, 214, 217, 116, 223, 135, 26, 156, 43, 158, 41, 40, 161, 59, 259, 260, 104, 103 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=(floor[sqrt[nprime(n)]]+1)^2-nprime(n)`
	EXAMPLE	`a(10)=34 because 10prime(10)+a(n)=1029+34=324=18^2`
	MATHEMATICA	`a[n_]:=(Floor[Sqrt[nPrime[n]]]+1)^2-nPrime[n]`
	CROSSREFS	`Sequence in context: A078298 A096063 A101281 this_sequence A121634 A006015 A110292` `Adjacent sequences: A106030 A106031 A106032 this_sequence A106034 A106035 A106036`
	KEYWORD	`nonn`
	AUTHOR	`Zak Seidov (zakseidov(AT)yahoo.com), May 05 2005`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research