# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a270470
Showing 1-1 of 1

%I A270470 #9 Mar 20 2016 12:57:48
%S A270470 1,3,10,23,24,47,60,107,108,167,180,240,250,323,383,503,540,575,600,
%T A270470 647,660,683,768,863,1008,1103,1200,1223,1320,1367,1620,1728,1800,
%U A270470 1860,2160,2207,2447,2520,2687,2688,2736,3000,3023,3060,3300,3360,3527,3528,3744,3863,3888,4200,4703,4800
%N A270470 Integers n such that A001654(n) is divisible by n*(n+1)/2.
%C A270470 Odd terms of this sequence are prime most of the time. Odd composite terms of this sequence are 1, 323, 575, 6479, 7055, ...
%e A270470 3 is a term because (1^2 + 1^2 + 2^2) / (1 + 2 + 3) = 1.
%e A270470 10 is a term because (1^2 + 1^2 + 2^2 + 3^2 + 5^2 + 8^2 + 13^2 + 21^2 + 34^2 + 55^2) / (1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 + 10) = 89.
%t A270470 nn = 4800; Function[k, Select[Range@ nn, Divisible[k[[# + 1]], # (# + 1)/2] &]]@ LinearRecurrence[{2, 2, -1}, {0, 1, 2}, nn + 1] (* _Michael De Vlieger_, Mar 19 2016, after _Vladimir Joseph Stephan Orlovsky_ at A001654 *)
%o A270470 (PARI) a(n) = fibonacci(n)*fibonacci(n+1);
%o A270470 for(n=1, 1e4, if(a(n) % (n*(n+1)/2) ==0, print1(n, ", ")));
%Y A270470 Cf. A000217, A001654.
%K A270470 nonn
%O A270470 1,2
%A A270470 _Altug Alkan_, Mar 17 2016

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE