login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082588 a(1) = 1, a(n) = Sum_{d | n and d < n} a(d)^2 for n > 1. 5
1, 1, 1, 2, 1, 3, 1, 6, 2, 3, 1, 16, 1, 3, 3, 42, 1, 16, 1, 16, 3, 3, 1, 308, 2, 3, 6, 16, 1, 31, 1, 1806, 3, 3, 3, 532, 1, 3, 3, 308, 1, 31, 1, 16, 16, 3, 1, 96936, 2, 16, 3, 16, 1, 308, 3, 308, 3, 3, 1, 1508, 1, 3, 16, 3263442, 3, 31, 1, 16, 3, 31, 1, 378456 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
The positions of records are A029744. - Andrey Zabolotskiy, Jan 30 2017
LINKS
FORMULA
a(p^(n+1)) = A007018(n) if p is a prime. - Michael Somos, May 19 2018
EXAMPLE
a(12) = a(1)^2 + a(2)^2 + a(3)^2 + a(4)^2 + a(6)^2 = 1^2 + 1^2 + 1^2 + 2^2 + 3^2 = 1 + 1 + 1 + 4 + 9 = 16.
MATHEMATICA
a[ n_] := If[ n < 2, Boole[n == 1], Sum[ a[d]^2, {d, Drop[Divisors @ n, -1]}]]; (* Michael Somos, May 19 2018 *)
PROG
(Python)
a = [1]
for n in range(2, 10001):
a.append(sum(a[d-1]**2 for d in range(1, n) if n%d == 0))
print(a)
# Andrey Zabolotskiy, Jan 30 2017
(PARI) a(n) = if (n==1, 1, sumdiv(n, d, if (d<n, a(d)^2))); \\ Michel Marcus, Jan 30 2017
CROSSREFS
Sequence in context: A357985 A140352 A277130 * A006241 A336105 A282601
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 13 2003
EXTENSIONS
Typo in data corrected by Andrey Zabolotskiy, Jan 30 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 10:45 EDT 2024. Contains 371709 sequences. (Running on oeis4.)