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!)
A134205 a(n) = A134204(n)+A134204(n-1). 3

%I #11 Oct 17 2017 09:28:12

%S 5,8,12,20,30,36,42,64,72,60,66,48,78,126,120,144,136,126,152,180,210,

%T 198,322,336,150,286,378,252,406,390,248,288,264,170,210,324,666,760,

%U 624,480,574,630,344,528,540,506,752,720,588,750,714,468,424,594,1100,1064,684

%N a(n) = A134204(n)+A134204(n-1).

%C a(n) is divisible by n for every n.

%H Michael De Vlieger, <a href="/A134205/b134205.txt">Table of n, a(n) for n = 1..10000</a>

%t With[{nn = 57}, Total /@ Partition[#, 2, 1] &@ Fold[Append[#1, SelectFirst[Prime@ Range[2, Ceiling& Log2[nn] nn], Function[p, And[FreeQ[#1, p], Divisible[Last@ #1 + p, #2]]]]] &, {2}, Range@ nn]] (* _Michael De Vlieger_, Oct 16 2017 *)

%Y Cf. A134204, A134206.

%K nonn

%O 1,1

%A _Leroy Quet_, Oct 14 2007

%E More terms from _Robert Israel_, Oct 14 2007

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 August 22 05:29 EDT 2024. Contains 375356 sequences. (Running on oeis4.)