cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A184241 Number of strings of numbers x(i=1..3) in 0..n with sum i^2*x(i)^2 equal to n^2*9.

This page as a plain text file.
%I A184241 #9 Jun 02 2025 03:27:07
%S A184241 1,1,2,1,1,2,1,1,3,2,2,2,2,2,4,1,2,3,4,2,4,2,3,2,2,4,7,2,2,6,3,1,8,2,
%T A184241 4,3,6,5,6,2,7,7,5,2,8,5,3,2,5,4,11,4,4,8,7,2,11,2,6,6,5,4,11,1,7,11,
%U A184241 8,2,13,7,6,3,8,8,14,5,9,9,8,2,14,8,6,7,7,7,16,2,8,12,10,5,12,5,13,2,5,8,20,4
%N A184241 Number of strings of numbers x(i=1..3) in 0..n with sum i^2*x(i)^2 equal to n^2*9.
%C A184241 Row 3 of A184240
%H A184241 R. H. Hardin, <a href="/A184241/b184241.txt">Table of n, a(n) for n = 1..200</a>
%e A184241 All solutions for n=5
%e A184241 ..0
%e A184241 ..0
%e A184241 ..5
%K A184241 nonn
%O A184241 1,3
%A A184241 _R. H. Hardin_ Jan 10 2011