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!)
A175649 a(n) = sopf(n) + sopf(n+1). 4

%I #13 Jan 08 2022 11:48:31

%S 2,5,5,7,10,12,9,5,10,18,16,18,22,17,10,19,22,24,26,17,23,36,28,10,20,

%T 18,12,38,39,41,33,16,33,31,17,42,58,37,23,48,53,55,56,21,33,72,52,12,

%U 14,27,35,68,58,21,25,31,53,90,69,71,94,43,12,20,34,83,86,45,40,85,76

%N a(n) = sopf(n) + sopf(n+1).

%C a(n)=A008472(n)+A008472(n+1).

%C a(n)=A008472(n(n+1)). - _Jon Maiga_, Jul 26 2019

%H Harvey P. Dale, <a href="/A175649/b175649.txt">Table of n, a(n) for n = 1..1000</a>

%t sopf[n_] := If[n < 2, 0, Plus @@ FactorInteger[n][[All, 1]]];

%t Table[sopf[n] + sopf[n + 1], {n, 71}] (* _Jon Maiga_, Jul 26 2019 *)

%t Join[{2},Total/@Partition[Table[Total[FactorInteger[n][[All,1]]],{n,2,80}],2,1]] (* _Harvey P. Dale_, Jan 08 2022 *)

%Y Cf. A008472.

%K nonn

%O 1,1

%A _Zak Seidov_, Aug 02 2010

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 April 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)