|
Search: id:A065734
|
|
|
| A065734 |
|
Largest square <= sigma[n]. |
|
+0
1
|
|
| 1, 1, 4, 4, 4, 9, 4, 9, 9, 16, 9, 25, 9, 16, 16, 25, 16, 36, 16, 36, 25, 36, 16, 49, 25, 36, 36, 49, 25, 64, 25, 49, 36, 49, 36, 81, 36, 49, 49, 81, 36, 81, 36, 81, 64, 64, 36, 121, 49, 81, 64, 81, 49, 100, 64, 100, 64, 81, 49, 144, 49, 81, 100, 121, 81, 144, 64, 121, 81, 144
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
FORMULA
|
a(n)=A048760[A000203(n)]=A048760[A000203(n)]
|
|
MATHEMATICA
|
Table[Floor[Sqrt[sigma(n)]//N]^2, {w, 1, 50}]
|
|
PROGRAM
|
(PARI) { for (n=1, 1000, a=sqrtint(sigma(n))^2; write("b065734.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 28 2009]
|
|
CROSSREFS
|
Cf. A048760, A000203, A065730-A065741
Sequence in context: A167184 A085071 A011412 this_sequence A048761 A075561 A117405
Adjacent sequences: A065731 A065732 A065733 this_sequence A065735 A065736 A065737
|
|
KEYWORD
|
easy,nonn,new
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 15 2001
|
|
|
Search completed in 0.002 seconds
|
