id:A065691 - OEIS Search Results

Search: id:A065691

Displaying 1-1 of 1 results found.

page 1

a(1) = 0; for n > 1 is a(n) the smallest integer > 0 such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.

+0
9

0, 10, 8, 16, 146, 22086, 31071113326, 365107058344463715696, 2684967738644586785227227090233956040549004, 809079884187716191997158821357206898310718837487307207657194711477350102495950972665 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = A061359(n-1) for n > 2.`
	CROSSREFS	`Cf. A050634, A050635, A061359, A065689, A065690.` `Sequence in context: A128357 A024134 A110934 this_sequence A038310 A118768 A008956` `Adjacent sequences: A065688 A065689 A065690 this_sequence A065692 A065693 A065694`
	KEYWORD	`base,nonn`
	AUTHOR	`Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 17 2001`

page 1

Search completed in 0.002 seconds

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.

AT&T Labs Research