Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Positive integers n such that the sum of the squares of all the substring decompositions of n is a multiple of n.
0

%I #2 Mar 31 2012 10:24:14

%S 1,2,3,4,5,6,7,8,9,101,202,233,303,351,404,427,466,505,606,699,707,

%T 808,909,1252,2068,5050,10001,19247,20002,30003,40004,50005,60006,

%U 70007,80008,90009,319519,500050

%N Positive integers n such that the sum of the squares of all the substring decompositions of n is a multiple of n.

%C No other term, between 500051 and 1000000, but integers such as 1000001, 2000002, 3000003, ..., or 50000050 will be in the sequence.

%e Example : 101 is in the sequence, because 0^2 + 1^2 + 10^2 + 101^2 = 10302 = 102*101

%e Example : 351 is in the sequence, because 1^2 + 3^2 + 5^2 + 35^2 + 51^2 + 351^2 = 127062 = 362*351

%K base,nonn

%O 1,2

%A _Jean-Marc Falcoz_, Jan 12 2009