The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A192688 Sum of omega-values for two consecutive indices where they equal the omega-value at the sum of the two indices. 0
1, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 4, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The sequence contains sums A001221(n) + A001221(n+1) whenever they are equal to A001221(2n+1).
Generated by indices n = 1, 7, 16, 31, 52, 82, 97, 136, 157, 172, 178, 192, 199, 232, 241, 256, 262, 277, 292, ...
LINKS
MAPLE
for n from 1 to 2000 do
if A001221(n)+A001221(n+1) = A001221(2*n+1) then
printf("%d, ", A001221(2*n+1)) ;
end if;
end do: # R. J. Mathar, Oct 12 2011
MATHEMATICA
f[n_] := Block[{a = PrimeNu[n] + PrimeNu[n + 1]}, If[a == PrimeNu[2n + 1], Return@ a]]; k = 1; lst = {}; While[k < 2600, If[f@k > 0, AppendTo[lst, f@ k]]; k++]; lst (* Robert G. Wilson v, Aug 29 2011 *)
CROSSREFS
Sequence in context: A127971 A319290 A230516 * A156752 A345073 A086673
KEYWORD
nonn
AUTHOR
STATUS
approved

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 June 6 15:47 EDT 2024. Contains 373132 sequences. (Running on oeis4.)