A335437 Numbers k with a partition into two distinct parts (s,t) such that k | s*t.
9, 16, 18, 25, 27, 32, 36, 45, 48, 49, 50, 54, 63, 64, 72, 75, 80, 81, 90, 96, 98, 99, 100, 108, 112, 117, 121, 125, 126, 128, 135, 144, 147, 150, 153, 160, 162, 169, 171, 175, 176, 180, 189, 192, 196, 198, 200, 207, 208, 216, 224, 225, 234, 240, 242, 243, 245, 250, 252, 256
Offset: 1
Keywords
Examples
16 is in the sequence since it has a partition into two distinct parts (12,4), such that 16 | 12*4 = 48.
References
- S. Dinh, The Hard Mathematical Olympiad Problems And Their Solutions, AuthorHouse, 2011, Problem 1 of International Mathematical Talent Search, round 7, page 285.
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000.
- International Mathematical Talent Search, Problem 1/7, Round 7.
- Eric Weisstein's World of Mathematics, Square part.
- Index to sequences related to Olympiads and other Mathematical Competitions.
- Index entries for sequences related to partitions.
Crossrefs
Programs
-
Mathematica
Table[If[Sum[(1 - Ceiling[(i*(n - i))/n] + Floor[(i*(n - i))/n]), {i, Floor[(n - 1)/2]}] > 0, n, {}], {n, 300}] // Flatten f[p_, e_] := p^(2*Floor[e/2]); sqpart[n_] := Times @@ f @@@ FactorInteger[n]; Select[Range[256], sqpart[#] > 4 &] (* Amiram Eldar, Mar 08 2021 *)
Comments