cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A296166 Numbers n such that the number of groups of order n exceeds the sum of divisors of n.

Original entry on oeis.org

64, 128, 192, 256, 288, 320, 384, 448, 512, 576, 640, 768, 864, 896, 960, 1024, 1152, 1280, 1344, 1408, 1440, 1536, 1600, 1664, 1728, 1792, 1920, 2048, 2112, 2176, 2187
Offset: 1

Views

Author

Muniru A Asiru, Dec 06 2017

Keywords

Comments

It seems that 1 is the only number such that the number of groups equals the sum of the divisors and that for almost all numbers the sum of the divisors exceeds the number of groups.

Examples

			64 is in the sequence because 267 = A000001(64) > A000203(64) = 127.
128 is in the sequence because 2328 = A000001(128) > A000203(128) = 255.
1920 is in the sequence because 241004 = A000001(1920) > A000203(1920) = 6120.
		

Crossrefs

Subsequence of A090052.

Programs

  • GAP
    A296166 := Filtered([1..2015], n -> NumberSmallGroups(n) > Sigma(n));
  • Maple
    with(GroupTheory): with(numtheory):
    for n from 1 to 2047 do if NumGroups(n) > sigma(n) then print(n); fi; od;
  • Mathematica
    Select[Range[10^4], FiniteGroupCount[#] > DivisorSigma[1, #] &] (* Amiram Eldar, Feb 19 2019 *)

Formula

Sequence is { n | A000001(n) > A000203(n) }.
Showing 1-1 of 1 results.