id:A061490 - OEIS Search Results

Search: id:A061490

Displaying 1-1 of 1 results found.

page 1

Smallest number which when iterated n times under A003285(n) gives a square.

+0
2

1, 2, 3, 19, 166, 8269 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Smallest m such that A003285(A003285(..(m))) = square with n iterations.`
	EXAMPLE	`A003285(A003285(3)))=1, 3 is the smallest number requiring 2 iterations to reach a square number, so a(2)=3.`
	CROSSREFS	`Cf. A003285` `Adjacent sequences: A061487 A061488 A061489 this_sequence A061491 A061492 A061493` `Sequence in context: A072877 A032329 A066227 this_sequence A048827 A032077 A014547`
	KEYWORD	`more,nonn`
	AUTHOR	`Naohiro Nomoto (n_nomoto(AT)yabumi.com), Nov 08 2001`

page 1

Search completed in 0.002 seconds

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.