This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A174793 Triangle read by rows: R(n,k)=n mod 2^Omega(k), where Omega( ) is number of prime divisors counted with multiplicity and 1 <= k <= n. 2
 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 2, 0, 2, 0, 1, 1, 3, 1, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 2, 0, 2, 0, 2, 2, 2, 0, 1, 1, 3, 1, 3, 1, 3, 3, 3, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 0, 0, 0, 2, 0, 2, 0, 6, 2, 2, 0, 6, 0, 2 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,19 LINKS EXAMPLE Triangle begins 0; 0, 0; 0, 1, 1; 0, 0, 0, 0; 0, 1, 1, 1, 1; 0, 0, 0, 2, 0, 2; MATHEMATICA Omega[n_] := If[n<2, 0, Plus@@Transpose[FactorInteger[n]][[2]]]; Flatten[Table[Mod[n, 2^Omega[k]], {n, 15}, {k, n}]] CROSSREFS Cf. A174624. Sequence in context: A263485 A263489 A238660 * A245718 A192011 A152855 Adjacent sequences:  A174790 A174791 A174792 * A174794 A174795 A174796 KEYWORD nonn,tabl AUTHOR Juri-Stepan Gerasimov, Nov 30 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 25 00:29 EDT 2019. Contains 322446 sequences. (Running on oeis4.)