cp's OEIS Frontend

A270699 Integers n such that A084158(n) is divisible by n.

%I A270699 #18 Mar 27 2016 22:10:33
%S A270699 1,3,5,11,13,15,19,29,35,37,43,53,59,61,67,75,83,101,107,109,119,131,
%T A270699 139,149,157,163,173,179,181,195,197,211,227,229,251,255,269,277,283,
%U A270699 293,307,317,331,347,349,373,375,379,389,397,419,421,435,443,455,461,467,491,499
%N A270699 Integers n such that A084158(n) is divisible by n.
%C A270699 For prime terms of this sequence, see A003629. Additionally, these prime numbers have the property that is in definition of A175865. Nonprime terms of this sequence are 1, 15, 35, 75, 119, 195, 255, 375, 435, 455, ...
%H A270699 Charles R Greathouse IV, <a href="/A270699/b270699.txt">Table of n, a(n) for n = 1..10000</a>
%e A270699 3 is a term because 1^2 + 2^2 + 5^2 = 30 is divisible by 3.
%e A270699 5 is a term because 1^2 + 2^2 + 5^2 + 12^2 + 29^2 = 1015 is divisible by 5.
%e A270699 13 is a term because A084158(13) = 1351523251 is divisible by 13.
%t A270699 nn = 500; s = LinearRecurrence[{5, 5, -1}, {0, 1, 5}, nn + 1]; Select[Range@ nn, Divisible[s[[# + 1]], #] &] (* _Michael De Vlieger_, Mar 23 2016, after _Harvey P. Dale_ at A270699 *)
%o A270699 (PARI) is(n)=(Mod([0, 1, 0; 0, 0, 1; -1, 5, 5],n)^n*[0; 1; 5])[1, 1]==0 \\ _Charles R Greathouse IV_, Mar 21 2016
%Y A270699 Cf. A000129, A003629, A084158, A175865.
%K A270699 nonn,easy
%O A270699 1,2
%A A270699 _Altug Alkan_, Mar 21 2016