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-2 of 2 results.

A276465 Divisors of 16450.

Original entry on oeis.org

1, 2, 5, 7, 10, 14, 25, 35, 47, 50, 70, 94, 175, 235, 329, 350, 470, 658, 1175, 1645, 2350, 3290, 8225, 16450
Offset: 1

Views

Author

Jaroslav Krizek, Sep 04 2016

Keywords

Comments

Conjecture: 16450 is the only number such that Sum_{d | n} 0.d is an integer, where 0.d means the decimal fraction of divisors d of n obtained by writing d after the decimal point:
0.1 + 0.2 + 0.5 + 0.7 + 0.10 + 0.14 + 0.25 + 0.35 + 0.47 + 0.50 + 0.70 + 0.94 + 0.175 + 0.235 + 0.329 + 0.350 + 0.470 + 0.658 + 0.1175 + 0.1645 + 0.2350 + 0.3290 + 0.8225 + 0.16450 = 9.
There are no other numbers with this property <= 5*10^7.

Crossrefs

Subsequences include A018262, A018270, A018319, A018406, A018472, and A018577.

Programs

  • Magma
    Divisors(16450)
    
  • Mathematica
    Divisors@ 16450 (* generates sequence *)
    Total@(#*1/10^(1 + Floor@ Log10@ #)) &@ Divisors@ 16450 (* illustrates comment, Michael De Vlieger, Sep 04 2016 *)
  • PARI
    divisors(16450) \\ Michel Marcus, Sep 04 2016

Formula

A276467(16450) = 1.

A320521 a(n) is the smallest even number k such that the symmetric representation of sigma(k) has n parts.

Original entry on oeis.org

2, 10, 50, 230, 1150, 5050, 22310, 106030, 510050, 2065450, 10236350
Offset: 1

Views

Author

Omar E. Pol, Oct 14 2018

Keywords

Comments

It appears that a(n) = 2 * q where q is odd and that the symmetric representation of sigma(a(n)/2) has the same number of parts as that for a(n). Number a(12) > 15000000. - Hartmut F. W. Hoft, Sep 22 2021

Examples

			a(1) = 2 because the second row of A237593 is [2, 2], and the first row of the same triangle is [1, 1], therefore between both symmetric Dyck paths there is only one part: [3], equaling the sum of the divisors of 2: 1 + 2 = 3. See below:
.
.     _ _ 3
.    |_  |
.      |_|
.
.
a(2) = 10 because the 10th row of A237593 is [6, 2, 1, 1, 1, 1, 2, 6], and the 9th row of the same triangle is [5, 2, 2, 2, 2, 5], therefore between both symmetric Dyck paths there are two parts: [9, 9]. Also there are no even numbers k < 10 whose symmetric representation of sigma(k) has two parts. Note that the sum of these parts is 9 + 9 = 18, equaling the sum of the divisors of 10: 1 + 2 + 5 + 10 = 18. See below:
.
.     _ _ _ _ _ _ 9
.    |_ _ _ _ _  |
.              | |_
.              |_ _|_
.                  | |_ _ 9
.                  |_ _  |
.                      | |
.                      | |
.                      | |
.                      | |
.                      |_|
.
a(3) = 50 because the 50th row of A237593 is [26, 9, 4, 3, 3, 1, 2, 1, 1, 1, 1, 2, 1, 3, 3, 4, 9, 26], and the 49th row of the same triangle is [25, 9, 5, 3, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 3, 5, 9, 25], therefore between both symmetric Dyck paths there are three parts: [39, 15, 39]. Also there are no even numbers k < 50 whose symmetric representation of sigma(k) has three parts. Note that the sum of these parts is 39 + 15 + 39 = 93, equaling the sum of the divisors of 50: 1 + 2 + 5 + 10 + 25 + 50 = 93. (The diagram of the symmetric representation of sigma(50) = 93 is too large to include.)
		

Crossrefs

Row 1 of A320537.
Cf. A237270 (the parts), A237271 (number of parts), A174973 (one part), A239929 (two parts), A279102 (three parts), A280107 (four parts), A320066 (five parts), A320511 (six parts).

Programs

  • Mathematica
    (* support functions are defined in A341969, A341970 & A341971 *)
    a320521[n_, len_] := Module[{list=Table[0, len], i, v}, For[i=2, i<=n, i+=2, v=Count[a341969[i], 0]+1;If[list[[v]]==0, list[[v]]=i]]; list]
    a320521[15000000,11] (* Hartmut F. W. Hoft, Sep 22 2021 *)

Extensions

a(6)-a(11) from Hartmut F. W. Hoft, Sep 22 2021
Showing 1-2 of 2 results.