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.

Previous Showing 11-20 of 20 results.

A262611 Triangle read by rows in which row n lists the widths of the symmetric representation of A024916(n): the sum of all divisors of all positive integers <= n.

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 3, 3, 3, 2, 1, 1, 2, 3, 3, 3, 3, 3, 2, 1, 1, 2, 3, 4, 4, 5, 4, 4, 3, 2, 1, 1, 2, 3, 4, 4, 4, 5, 4, 4, 4, 3, 2, 1, 1, 2, 3, 4, 5, 5, 5, 6, 5, 5, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 5, 5, 6, 7, 6, 5, 5, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 6, 6, 6, 7, 7, 7, 6, 6, 6, 5, 4, 3, 2, 1, 1, 2, 3, 4, 5, 6, 6, 6, 6, 7, 7, 7, 6, 6, 6, 6, 5, 4, 3, 2, 1
Offset: 1

Views

Author

Omar E. Pol, Sep 26 2015

Keywords

Comments

Here T(n,k) is defined to be the "k-th width" of the symmetric representation of A024916(n), with n>=1 and 1<=k<=2n-1.
If both A249351 and this sequence are written as isosceles triangles then the partial sums of the columns of A249351 give the columns of this isosceles triangle (see the second triangle in Example section).
For the definition of the k-th width of the symmetric representation of sigma(n) see A249351.
Note that for the geometric representation of the n-th row of the triangle we need the x-axis, the y-axis, and only a Dyck path which is given by the elements of the n-th row of the triangle A237593.
Row n has length 2*n-1.
Row sums give A024916.
The middle diagonal is A240542.

Examples

			Triangle begins:
1;
1,2,1;
1,2,2,2,1;
1,2,3,3,3,2,1;
1,2,3,3,3,3,3,2,1;
1,2,3,4,4,5,4,4,3,2,1;
1,2,3,4,4,4,5,4,4,4,3,2,1;
1,2,3,4,5,5,5,6,5,5,5,4,3,2,1;
1,2,3,4,5,5,5,6,7,6,5,5,5,4,3,2,1;
1,2,3,4,5,6,6,6,7,7,7,6,6,6,5,4,3,2,1;
1,2,3,4,5,6,6,6,6,7,7,7,6,6,6,6,5,4,3,2,1;
1,2,3,4,5,6,7,7,7,8,9,9,9,8,7,7,7,6,5,4,3,2,1;
...
--------------------------------------------------------------------------
.        Written as an isosceles triangle
.              the sequence begins:               Diagram for n = 1..12
--------------------------------------------------------------------------
.                                                _ _ _ _ _ _ _ _ _ _ _ _
.                      1;                       |_| | | | | | | | | | | |
.                    1,2,1;                     |_ _|_| | | | | | | | | |
.                  1,2,2,2,1;                   |_ _|  _|_| | | | | | | |
.                1,2,3,3,3,2,1;                 |_ _ _|    _|_| | | | | |
.              1,2,3,3,3,3,3,2,1;               |_ _ _|  _|  _ _|_| | | |
.            1,2,3,4,4,5,4,4,3,2,1;             |_ _ _ _|  _| |  _ _|_| |
.          1,2,3,4,4,4,5,4,4,4,3,2,1;           |_ _ _ _| |_ _|_|    _ _|
.        1,2,3,4,5,5,5,6,5,5,5,4,3,2,1;         |_ _ _ _ _|  _|     |
.      1,2,3,4,5,5,5,6,7,6,5,5,5,4,3,2,1;       |_ _ _ _ _| |      _|
.    1,2,3,4,5,6,6,6,7,7,7,6,6,6,5,4,3,2,1;     |_ _ _ _ _ _|  _ _|
.  1,2,3,4,5,6,6,6,6,7,7,7,6,6,6,6,5,4,3,2,1;   |_ _ _ _ _ _| |
.1,2,3,4,5,6,7,7,7,8,9,9,9,8,7,7,7,6,5,4,3,2,1; |_ _ _ _ _ _ _|
...
For n = 3 the symmetric representation of A024916(3) = 8 in the 4th quadrant looks like this:
.
.    Polygon         Cells
.     _ _ _          _ _ _
.    |     |        |_|_|_|
.    |    _|        |_|_|_|
.    |_ _|          |_|_|
.
There are eight cells. The representation of the widths looks like this:
.
.     \ \ \
.     \ \ \
.     \ \    1
.          2 2
.        1 2
.
So the third row of the triangle is [1, 2, 2, 2, 1].
		

Crossrefs

A246956 Numbers a(n) = 2^(n-1) * f(n), where n >= 1 and f(n) is the smallest prime number larger than 2^n (A014210).

Original entry on oeis.org

3, 10, 44, 136, 592, 2144, 8384, 32896, 133376, 527872, 2102272, 8394752, 33624064, 134438912, 536920064, 2147516416, 8591835136, 34360131584, 137444458496, 549759483904, 2199041081344, 8796124479488, 35184409837568, 140737849065472, 562950540623872, 2251800317001728, 9007201200898048, 36028797421617152, 144115191028645888, 576460753914036224, 2305843021024854016, 9223372069067030528
Offset: 1

Views

Author

Hartmut F. W. Hoft, Sep 08 2014

Keywords

Comments

The sequence is the "diagonal" - first element in each column - of the triangle of numbers associated with the symmetric representation of sigma(n) when it has two parts, each of width one (see A246955).

Examples

			a(4) = 8 * 17 = 136 since 17 is the first prime larger than 16.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := Module[{v = 2^n + 1}, While[!PrimeQ[v], v++]; v]
    a[n_] := 2^(n - 1) f[n]
    Map[a,Range[32]] (* data *)
  • PARI
    a(n) = 2^(n-1) * nextprime(2^n+1); \\ Michel Marcus, Sep 23 2014

A264102 Numbers n with the property that the symmetric representation of sigma(n) has four parts, each of width one.

Original entry on oeis.org

21, 27, 33, 39, 51, 55, 57, 65, 69, 85, 87, 93, 95, 111, 115, 119, 123, 125, 129, 133, 141, 145, 155, 159, 161, 177, 183, 185, 201, 203, 205, 213, 215, 217, 219, 230, 235, 237, 249, 250, 253, 259, 265, 267, 287, 290, 291, 295, 301, 303, 305, 309, 310, 319, 321, 327, 329, 335
Offset: 1

Views

Author

Hartmut F. W. Hoft, Nov 03 2015

Keywords

Comments

The areas of the first two regions are (2^(m+1) - 1) * (p * q + 1) / 2 and (2^(m+1) - 1) * (p + q) / 2, respectively. Twice their sum equals sigma(n) = (2^(m+1) - 1) * (p + 1) * (q + 1).
For a proof of the formula for this sequence see the link.

Examples

			65 = 5*13 is in the sequence since m = 0 and 2 < 5 < 10 < 13. The first two regions in the symmetric representation of sigma(65) = 84 start with legs 1 and 5 of the Dyck path and have areas 33 and 9, respectively.
406 = 2*7*29 is in the sequence since m=1 and 4 < 7 < 28 < 29. The first two regions in the symmetric representation of sigma(406) = 720 start with legs 1 and 7 and have areas 306 and 54, respectively. Note also that 406 is a triangular number and the middle two regions meet at the center of the Dyck path.
One case in the formula for the sequence is the 3-parameter expression n = 2^m * p * q with p and q distinct primes satisfying the stated conditions. That subsequence can be visualized as a skew tetrahedron since the start of each "line" on an irregular "triangular" side of the "tetrahedron" is determined by a different prime number and each layer is determined by a different power of two. Below are the first three layers with primes p designating columns and primes q rows.
m=0| 3    5    7    11   13
-----------------------------
7  | 21
11 | 33   55
13 | 39   65
17 | 51   85   119
19 | 57   95   133
23 | 69   115  161  253
29 | 87   145  203  319  377
31 | 93   155  217  341  403
37 | 111  185  259  407  481
41 | 123  205  287  451  533
...
89 | 267  445  623  979  1157
...
Column 1 is A001748 except for the first three terms and column 2 is A001750 except for the first four terms in the two resepctive sequences.
m=1| 3    5    7    11   13
-------------------------------
23 |     230
29 |     290  406
31 |     310  434
37 |     370  518
41 |     410  574
43 |     430  602
47 |     470  658  1034
53 |     530  742  1166  1378
...
89 |     890  1246 1958  2314
...
m=2| 3    5    7    11   13
-------------------------------
89 |               3916
97 |               4268
101|               4444
103|               4532
107|               4708  5564
109|               4796  5668
...
The fourth layer for m = 3 starts with number 37672 in column p = 17 and row q = 277.
The subsequence of the 2-parameter case n = 2^m * p^3 with 2^(m+1) < p gives rise to the following irregular triangle:
p\m| 0      1       2       3
----------------------------------
3  | 27
5  | 125    250
7  | 343    686
11 | 1331   2662    5324
13 | 2197   4394    8788
17 | 4913   9826    19652   39304
19 | 6859   13718   27436   54872
23 | 12167  24334   48668   97336
29 | 24389  48778   97556   195112
...
The first column in this triangle is A030078 except for the first term and the second column is A172190 except for the first two terms respectively in the two sequences.
		

Crossrefs

For symmetric representation of sigma: A235791, A236104, A237270, A237271, A237591, A237593, A241008, A246955.
Subsequence of A280107.

Programs

  • Mathematica
    mpStalk[m_, p_, bound_] := Module[{q=NextPrime[2^(m+1)*p], list={}}, While[2^m*p*q<=bound, AppendTo[list, 2^m*p*q]; q=NextPrime[q]]; If[2^m*p^3<=bound, AppendTo[list, 2^m*p^3]]; list]
    mTriangle[m_, bound_] := Module[{p=NextPrime[2^(m+1)], list={}}, While[2^m*p*NextPrime[2^(m+1)*p]<=bound, list=Union[list, mpStalk[m, p, bound]]; p=NextPrime[p]]; list]
    (* 2^(4m+3)<=bound is a simpler test, but computes some empty stalks *)
    a264102[bound_] := Module[{m=0, list={}}, While[2^m*NextPrime[2^(m+1)]*NextPrime[2^(m+1)*NextPrime[2^(m+1)]]<=bound, list=Union[list, mTriangle[m, bound]]; m++]; list]
    a264102[335] (* data *)

Formula

n = 2^m * p * q where m >= 0, p > 2 is prime, 2^(m+1) < p < 2^(m+1) * p < q, and either q is prime or q = p^2.

A357581 Square array read by antidiagonals of numbers whose symmetric representation of sigma consists only of parts that have width 1; column k indicates the number of parts and row n indicates the n-th number in increasing order in each of the columns.

Original entry on oeis.org

1, 2, 3, 4, 5, 9, 8, 7, 25, 21, 16, 10, 49, 27, 81, 32, 11, 50, 33, 625, 147, 64, 13, 98, 39, 1250, 171, 729, 128, 14, 121, 51, 2401, 207, 15625, 903, 256, 17, 169, 55, 4802, 243, 31250, 987, 3025, 512, 19, 242, 57, 14641, 261, 117649, 1029, 3249, 6875
Offset: 1

Views

Author

Hartmut F. W. Hoft, Oct 04 2022

Keywords

Comments

This sequence is a permutation of A174905. Numbers in the even numbered columns of the table form A241008 and those in the odd numbered columns form A241010. The first row of the table is A318843.
This sequence is a subsequence of A240062 and each column in this sequence is a subsequence in the respective column of A240062.

Examples

			The upper left hand 11 X 11 section of the table for a(n) <= 2*10^7:
     1   2    3   4      5    6         7     8      9     10        11 ...
  ----------------------------------------------------------------------
     1   3    9  21     81  147       729   903   3025   6875     59049
     2   5   25  27    625  171     15625   987   3249   7203   9765625
     4   7   49  33   1250  207     31250  1029   4761  13203  19531250
     8  10   50  39   2401  243    117649  1113   6561  13527       ...
    16  11   98  51   4802  261    235298  1239   7569  14013       ...
    32  13  121  55  14641  275   1771561  1265   8649  14499       ...
    64  14  169  57  28561  279   3543122  1281  12321  14661       ...
   128  17  242  65  29282  333   4826809  1375  14161  15471       ...
   256  19  289  69  57122  363   7086244  1407  15129  15633       ...
   512  22  338  85  58564  369   9653618  1491  16641  15957       ...
  1024  23  361  87  83521  387  19307236  1533  17689  16119       ...
  ...
Each column k > 1 contains odd and even numbers since, e.g., 5^(k-1) and 2 * 5^(k-1) belong to it.
Column 1: A000079, subsequence of A174973 = A238443, and of column 1 in A240062.
Column 2: A246955, subsequence of A239929; 78 is the smallest number not in A246955.
Column 3: A247687, subsequence of A279102; 15 is the smallest number not in A247687.
  Odd numbers in column 3: A001248(k), k > 1.
Column 4: A264102, subsequence of A280107; 75 is the smallest number not in A264102.
Column 5: subsequence of A320066; 63 = A320066(1) is not in column 5.
  Numbers in column 5 have the form 2^k * p^4 with p > 2 prime and 0 <= k < floor(log_2(p)).
  Odd numbers in column 5: A030514(k), k > 1.
Column 6: subsequence of A320511; 189 is the smallest number not in column 6.
  Smallest even number in column 6 is 5050.
Column 7: Numbers have the form 2^k * p^6 with p > 2 prime and 0 <= k < floor(log_2(p)).
  Odd numbers in column 7: A030516(k), k > 1.
Numbers in the column numbered with the n-th prime p_n have the form: 2^k * p^(p_n - 1) with p > 2 prime and 0 <= k < floor(log_2(p_n)).
		

Crossrefs

Programs

  • Mathematica
    (* function a341969 and support functions are defined in A341969, A341970 and A341971 *)
    width1Table[n_, {r_, c_}] := Module[{k, list=Table[{}, c], wL, wLen, pCount, colLen}, For[k=1, k<=n, k++, wL=a341969[k]; wLen=Length[wL]; pCount=(wLen+1)/2; If[pCount<=c&&Length[list[[pCount]]]=1, j--, vec[[PolygonalNumber[i+j-2]+j]]=arr[[i, j]]]]; vec]
    a357581T[n_, r_] := TableForm[width1Table[n, {r, r}]]
    a357581[120000, 10] (* sequence data - first 10 antidiagonals *)
    a357581T[120000, 10] (* upper left hand 10x10 array *)
    a357581T[20000000, 11] (* 11x11 array - very long computation time *)

A365406 Numbers j whose largest divisor <= sqrt(j) is a power of 2.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 16, 17, 19, 20, 22, 23, 24, 26, 28, 29, 31, 32, 34, 37, 38, 41, 43, 44, 46, 47, 52, 53, 58, 59, 61, 62, 64, 67, 68, 71, 72, 73, 74, 76, 79, 80, 82, 83, 86, 88, 89, 92, 94, 96, 97, 101, 103, 104, 106, 107, 109, 112, 113, 116, 118, 122, 124, 127, 128, 131, 134, 136, 137
Offset: 1

Views

Author

Omar E. Pol, Oct 10 2023

Keywords

Comments

Also indices of the powers of 2 in A033676.
Also numbers in increasing order from the columns k of A163280 where k is a power of 2.
Observation: at least the first 82 terms of the subsequence of terms with no middle divisors (that is 3, 5, 7, 10, ...) coincide with at least the first 82 terms of A246955.
For the definition of middle divisor see A067742.
From Peter Munn, Oct 26 2023: (Start)
Most of the early terms are in A342081, which consists of powers of 2 together with products of a prime and a power of 2 where the prime is the larger. The exceptions are 24, 72, 80, 96, 112, ... .
The odd terms clearly consist of 1 and the odd primes. We can fully characterize the even terms by their A290110 values, which depend on the relative sizes of a number's divisors. A290110 provides a refinement of the classification of numbers by prime signature (cf. A212171): see the example below for numbers with the same prime signature as 48.
(End)

Examples

			From _Peter Munn_, Oct 26 2023: (Start)
The table below looks at numbers j with prime signature (4, 1), showing the presence of j and its characterization by A290110(j):
    j             A290110(j)  present
    48 = 2^4 * 3      16         no
    80 = 2^4 * 5      21        yes
   112 = 2^4 * 7      21        yes
   162 = 2 * 3^4      36         no
   176 = 2^4 * 11     38         no
   208 = 2^4 * 13     38         no
   272 = 2^4 * 17     51        yes
   304 = 2^4 * 19     51        yes
   368 = 2^4 * 23     51        yes
  ...
Clearly any odd composite number is exempted, for example:
   891 = 3^4 * 11     21         no
  6723 = 3^4 * 83     51         no
Note that A290110(j) = 36 for j = 2 * p^4, prime p; and A290110(j) = 51 for j = 2^4 * p, prime p >= 17.
(End)
		

Crossrefs

Cf. A342081 (a subsequence), A365408 (complement), A365716 (characteristic function).

Programs

  • Mathematica
    q[n_] := Module[{d = Divisors[n], mid}, mid = d[[Ceiling[Length[d]/2]]]; mid == 2^IntegerExponent[mid, 2]]; Select[Range[150], q] (* Amiram Eldar, Oct 11 2023 *)
  • PARI
    f(n) = local(d); if(n<2, 1, d=divisors(n); d[(length(d)+1)\2]); \\ A033676
    isp2(n) = 2^logint(n,2) == n;
    isok(k) = isp2(f(k)); \\ Michel Marcus, Oct 11 2023
    
  • Python
    from itertools import count, islice
    from sympy import divisors
    def A365406_gen(startvalue=1): # generator of terms >= startvalue
        return filter(lambda i:(a:=(d:=divisors(i))[len(d)-1>>1])==1<A365406_list = list(islice(A365406_gen(),30)) # Chai Wah Wu, Oct 18 2023

A244250 Triangle read by rows in which row n lists the widths in the first octant of the symmetric representation of sigma(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Omar E. Pol, Oct 26 2014

Keywords

Comments

For the definition of k-th width of the symmetric representation of sigma(n) see A249351.
Row n list the first n terms of the n-th row of A249351.
It appears that the leading diagonal is also A067742 (which was conjectured by Michel Marcus in the entry A237593 and checked with two Mathematica functions up to n = 100000 by Hartmut F. W. Hoft).
For more information see A237591, A237593.

Examples

			Triangle begins:
1;
1, 1;
1, 1, 0;
1, 1, 1, 1;
1, 1, 1, 0, 0;
1, 1, 1, 1, 1, 2;
1, 1, 1, 1, 0, 0, 0;
1, 1, 1, 1, 1, 1, 1, 1;
1, 1, 1, 1, 1, 0, 0, 1, 1;
1, 1, 1, 1, 1, 1, 1, 1, 1, 0;
1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0;
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2;
1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0;
...
		

Crossrefs

A362866 Numbers k with the property that the parts of the symmetric representation of sigma(k) are two octagons.

Original entry on oeis.org

10, 14, 22, 26, 34, 38, 46, 58, 62, 74, 82, 86, 94, 106, 118, 122, 134, 142, 146, 158, 166, 178, 194, 202, 206, 214, 218, 226, 254, 262, 274, 278, 298, 302, 314, 326, 334, 346, 358, 362, 382, 386, 394, 398, 422, 446, 454, 458, 466, 478, 482, 502, 514, 526
Offset: 1

Views

Author

Omar E. Pol, May 06 2023

Keywords

Comments

Note that odd primes (A065091) are also the numbers j with the property that the parts of the symmetric representation of sigma(j) are two rectangles or more generally two quadrilaterals.
Conjecture 1: The octagons are S-shaped and they have width 1.
Conjecture 2: This sequence is also the primes doubled (or even semiprimes) >= 10 (Cf. A100484). - Omar E. Pol, Aug 15 2023
For the symmetric representation of sigma(n) to consist of 2 octagons the first 3 entries in row n of the triangle of A249223 must be nonzero, hence must be 1's, indicating width 1, with the remaining entries zero. Therefore, row n of A237048 is 100100..., implying n = 2*p with p>3 prime. Both conjectures are true. - Hartmut F. W. Hoft, Aug 22 2023
From Omar E. Pol, Aug 23 2023: (Start)
Also the row numbers of the triangle A364639 where the rows are [1, 0, -1, 1] or where the rows start with [1, 0, -1, 1] and the remaining terms are zeros.
Each supersequence A063221 >= 10 and A091999 >= 10 gives the numbers k with the property that the first part of the symmetric representation of sigma(k) is an octagon. In that case each supersequence gives the row numbers of the triangle A364639 where the rows start with [1, 0, -1]. (End)

Examples

			The symmetric representation of sigma(14) in the first quadrant is as follows:
.   _ _ _ _ _ _ _ _
   |_ _ _ _ _ _ _  |
                 | |
                 | |_
                 |_ _|
                     |_ _
                       | |_ _ _
                       |_ _ _  |
                             | |
                             | |
                             | |
                             | |
                             | |
                             | |
                             |_|
.
The diagram has only two parts (or polygons) and both are octagons so 14 is in the sequence.
		

Crossrefs

Extensions

More terms from Omar E. Pol, Aug 15 2023

A264104 Numbers n with the property that the symmetric representation of sigma(n) has four parts, each of width one and two regions meet at the center of the Dyck path.

Original entry on oeis.org

21, 55, 253, 406, 1081, 1378, 1711, 3403, 3916, 5671, 9316, 11026, 13861, 14878, 15931, 25651, 27028, 34453, 36046, 42778, 50086, 60031, 64261, 73153, 75466, 108811, 114481, 126253, 129286, 154846, 158203, 161596, 171991, 175528, 212878, 258121, 298378, 317206, 326836, 351541, 366796, 371953, 392941
Offset: 1

Views

Author

Hartmut F. W. Hoft, Nov 03 2015

Keywords

Comments

This sequence is a subsequence of A264102 and also of A014105, the second hexagonal numbers. Every number in this sequence is a triangular number.
The sequence A156592 of products of a Sophie Germain prime (A005384) and its associated safe prime (A005385) except for the first pair (2, 5) forms a subsequence of this sequence, the first column in the irregular triangular grid in the example.
The areas of the first two regions are (2^(m+1) - 1) * (2^(m+1) * p^2 * p + 1) / 2 and (2^(m+1) - 1) * (2^(m+1) * p + p + 1) / 2, respectively. Twice their sum equals sigma(n) = (2^(m+1) - 1) * (p + 1) * (2^(m+1) * p + 2).
For a proof of the formula for this sequence see the link.

Examples

			406 = 2*7*29 is in the sequence since m = 1 and 4 < 7 < 28 < 29. The first two regions in the symmetric representation of sigma(406) = 720 start with legs 1 and 7 and have areas 306 and 54, respectively. Note also that 406 is a triangular number and the middle two regions meet at the center of the Dyck path.
10 does not belong to this sequence since the symmetric representation of sigma(10) has two regions of width 1 that meet at the diagonal.
There is a natural arrangement of the numbers n = 2^m * p * (2^(m+1) * p + 1) as a sparse irregular triangular (p,m)-grid.
p\m| 0      1       2        3        4        5   ...
-------------------------------------------------------
3  | 21
5  | 55
7  |        406
11 | 253            3916
13 |        1378
17 |                9316
19 |
23 | 1081
29 | 1711           27028
31 |
37 |        11026           175528
41 | 3403
43 |        14878
47 |
53 | 5671                           1439056
59 |                                1783216
61 |                        476776
67 |        36046                            9195616
71 |                161596          2582128
73 |        42778                            10916128
...
The first number in the m = 6 column is 181880128 = 2^6*149*19073 in row p = 149 and the second is 228477376 = 2^6*167*21377 in row p = 167.
		

Crossrefs

For symmetric representation of sigma: A235791, A236104, A237270, A237271, A237591, A237593, A241008, A246955.

Programs

  • Mathematica
    mStalk[m_, bound_] := Module[{p=NextPrime[2^(m+1)], list={}}, While[2^m*p*(2^(m+1)*p+1)<=bound, If[PrimeQ[2^(m+1)*p+1], AppendTo[list, 2^m *p*(2^(m+1)*p+1)]]; p=NextPrime[p]]; list]
    a264104[bound_] := Module[{m=0, list={}}, While[2^m*NextPrime[2^(m+1)]*(2^(m+1)*NextPrime[2^(m+1)]+1)<=bound, list=Union[list, mStalk[m, bound]]; m++]; list]
    a264104[400000] (* data *)

Formula

n = 2^m * p * (2^(m+1) * p + 1) where m >= 0, 2^(m+1) < p and p as well as 2^(m+1) * p + 1 are prime.

A347262 Positive integers that are not the numbers k for which the symmetric representation of sigma(k) has two parts, each of width one.

Original entry on oeis.org

1, 2, 4, 6, 8, 9, 12, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 32, 33, 35, 36, 39, 40, 42, 45, 48, 49, 50, 51, 54, 55, 56, 57, 60, 63, 64, 65, 66, 69, 70, 72, 75, 77, 78, 80, 81, 84, 85, 87, 88, 90, 91, 93, 95, 96, 98, 99, 100, 102, 104, 105, 108, 110, 111, 112, 114
Offset: 1

Views

Author

Omar E. Pol, Aug 28 2021

Keywords

Comments

First differs from A071562 at a(12) = 21 here, there a(12) = 24.

Examples

			6 is in the sequence because the symmetric representation of sigma(6) has only one part. The 11 widths of 6 are [1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1]. The sum of them is A000203(6) = 12.
9 is in the sequence because the symmetric representation of sigma(9) has three parts. The 17 widths of 9 are [1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1]. The sum of them is A000203(9) = 13.
78 is in the sequence because the symmetric representation of sigma(78) has two parts but not all their widths are one since 14 widths are two. The 155 widths of 78 are [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], the same as the 78th row of A249351. The sum of the widths is equal to A000203(78) = 168.
14 is not in the sequence because the symmetric representation of sigma(14) has two parts, each of width one. The 27 widths of 14 are [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], the same as the 14th row of A249351. The sum of the widths is equal to A000203(14) = 24.
For the definition of "width" see A249351.
		

Crossrefs

Programs

  • Mathematica
    (* functions a237048 and a237270 are defined in the respective sequences *)
    a249223[n_] :=Drop[FoldList[Plus, 0, Map[(-1)^(#+1) a237048[n, #]&, Range[row[n]]]], 1]
    a347262[n_] := Select[Range[n], Length[a237270[#]]!=2||Max[a249223[#]]!=1&]
    a347262[114] (* Hartmut F. W. Hoft, Jul 20 2022 *)

A365440 Square array read by upward antidiagonals: T(n,k) is the n-th number j with the property that the parts of the symmetric representation of sigma(j) are two s-gon of width 1, where s = 2^(k+1), n >= 1, k >= 1.

Original entry on oeis.org

3, 5, 10, 7, 14, 44, 11, 22, 52, 136, 13, 26, 68, 152, 592, 17, 34, 76, 184, 656
Offset: 1

Views

Author

Omar E. Pol, Sep 25 2023

Keywords

Comments

For column k = 1, 2, 3, 4, 5, ... the number of sides of the mentioned s-gon are respectively 4, 8, 16, 32, 64, ...
Conjecture 1: column k gives the row numbers of the triangle A364639 where the rows are [1, A036563(k+1) zeros, -1, 1] or where the rows start with [1, A036563(k+1) zeros, -1, 1] and the remaining terms are zeros.
Conjecture 2: every column gives a subsequence of A246955.
Conjecture 3: the sequence is infinite.
Observation 1: at least the terms <= 199 in increasing order coincide with at least the first 82 terms of the intersection of A071561 and A365406.
Observation 2: in the Example section of A246955 there is an irregular triangle. It seems that the terms sorted of the triangle give the sequence A246955. At least the first r(k) terms in the column (k - 1) of the triangle coincide with the first r(k) terms of the column k of this square array, where r(k) are 19, 18, 16, 14, 7 for k = 1..5 respectively.
Observation 3: at least the first five terms of the row 1 coincide with the first five terms of A246956.

Examples

			The corner of the square array is as shown below:
   3, 10,  44, 136, 592, ...
   5, 14,  52, 152, 656, ...
   7, 22,  68, 184, 688, ...
  11, 26,  76, 232, 752, ...
  13, 34,  92, 248, 848, ...
  17, 38, 116, 296, 944, ...
  19, 46, 124, 328, 976, ...
  ...
		

Crossrefs

Previous Showing 11-20 of 20 results.