editing
approved
editing
approved
a(n) = n^((d(n) mod 2)/2) for n>=1. - Wesley Ivan Hurt, Jun 07 2023
approved
editing
proposed
approved
editing
proposed
a(n) = sqrt(n) if n is a square, otherwise 1.
Like A037213, but has 1's instead of 0's for nonsquare n > 0. - Antti Karttunen, Jul 22 2018
Antti Karttunen, <a href="/A056926/b056926.txt">Table of n, a(n) for n = 0..65537</a>
0, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 1, 1
1,4
0,5
a(24) = 1 because 24 is not a square, a(25) = 5 because 25 = 5^2.
(PARI) A056926(n) = if(issquare(n, &n), n, 1); \\ Antti Karttunen, Jul 22 2018
Cf. A000196.
Term a(0) = 0 prepended by Antti Karttunen, Jul 22 2018
approved
editing
sq1[n_]:=Module[{sn=Sqrt[n]}, If[IntegerQ[sn], sn, 1]]; Array[sq1, 110] (* From _Harvey P. Dale, _, Jul 25 2011 *)
_Henry Bottomley (se16(AT)btinternet.com), _, Jul 12 2000
editing
approved
sq1[n_]:=Module[{sn=Sqrt[n]}, If[IntegerQ[sn], sn, 1]]; Array[sq1, 110] (* From Harvey P. Dale, Jul 25 2011 *)
approved
editing