[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A378294 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Nonnegative norms of ideals in Q(sqrt(10), sqrt(26)).
(history; published version)
#17 by Sean A. Irvine at Thu Nov 28 13:29:17 EST 2024
STATUS

proposed

approved

#16 by Jovan Radenkovicc at Mon Nov 25 16:49:16 EST 2024
STATUS

editing

proposed

Discussion
Wed Nov 27
09:42
Thomas Scheuerle: Dear Jovan, I tried to send you an e-mail, but your e-mail is disabled in the wiki. By the way, would it be OK if I try to add PARI code to your sequences?
09:46
Jovan Radenkovicc: No. I don't know enough PARI.
Thu Nov 28
11:24
N. J. A. Sloane: Jovan Radenkovicc is now permanently blocked from the OEIS for destructive editing of OEIS entries. Now we - the editors - have to decide what to do about all the proposed and rejected changes to the present sequence and to his other two submissions on the stack.
#15 by Jovan Radenkovicc at Mon Nov 25 16:49:12 EST 2024
PROG

[n: n in [0..400250] | IsRepresentablePoly(n, {10, 26})];

STATUS

proposed

editing

#14 by Michel Marcus at Sat Nov 23 04:59:20 EST 2024
STATUS

editing

proposed

Discussion
Sat Nov 23
04:59
Michel Marcus: please have a look at the stylesheet
#13 by Michel Marcus at Sat Nov 23 04:59:15 EST 2024
DATA

0, 1, 2, 4, 5, 8, 9, 10, 13, 16, 18, 20, 25, 26, 32, 36, 37, 40, 45, 49, 50, 52, 64, 65, 67, 72, 74, 79, 80, 81, 83, 90, 98, 100, 104, 117, 121, 125, 128, 130, 134, 144, 148, 158, 160, 162, 163, 166, 169, 180, 185, 191, 196, 197, 199, 200, 208, 225, 227, 234, 242, 245, 250, 256, 260, 268, 288, 289, 293, 296, 307, 311, 316, 317, 320, 324, 325, 326, 332, 333, 335, 338, 360, 361, 370, 382, 392, 394, 395, 397, 398, 400

KEYWORD

nonn,more,changed

STATUS

proposed

editing

#12 by Jovan Radenkovicc at Sat Nov 23 03:54:34 EST 2024
STATUS

editing

proposed

#11 by Jovan Radenkovicc at Sat Nov 23 03:54:30 EST 2024
FORMULA

A positive iinteger integer n is in this sequence if and only if all prime factors of n congruent to {3, 7, 11, 17, 19, 21, 23, 27, 29, 31, 33, 41, 43, 47, 51, 53, 57, 59, 61, 63, 69, 71, 73, 77, 87, 89, 97, 99, 101, 103, 107, 109, 111, 113, 119, 127, 131, 133, 137, 139, 141, 147, 149, 151, 153, 157, 161, 167, 171, 173, 177, 179, 181, 183, 189, 193, 201, 207, 211, 217, 219, 223, 229, 233, 237, 239, 241, 243, 249, 251, 257, 259, 261, 263, 269, 271, 277, 279, 281, 283, 287, 291, 297, 301, 303, 309, 313, 319, 327, 331, 337, 339, 341, 343, 347, 349, 353, 359, 363, 367, 369, 371, 373, 379, 381, 383, 387, 389, 393, 401, 407, 409, 411, 413, 417, 419, 421, 423, 431, 433, 443, 447, 449, 451, 457, 459, 461, 463, 467, 469, 473, 477, 479, 487, 489, 491, 493, 497, 499, 501, 503, 509, 513, 517} mod 520 occur with even exponents.

STATUS

proposed

editing

#10 by Jovan Radenkovicc at Sat Nov 23 03:54:00 EST 2024
STATUS

editing

proposed

#9 by Jovan Radenkovicc at Sat Nov 23 03:53:55 EST 2024
DATA

0, 1, 2, 4, 5, 8, 9, 10, 13, 16, 18, 20, 25, 26, 32, 36, 37, 40, 45, 49, 50, 52, 64, 65, 67, 72, 74, 79, 80, 81, 83, 90, 98, 100, 104, 117, 121, 125, 128, 130, 134, 144, 148, 158, 160, 162, 163, 166, 169, 180, 185, 191, 196, 197, 199, 200, 208, 225, 227, 234, 242, 245, 250, 256, 260, 268, 288, 289, 293, 296, 307, 311, 316, 317, 320, 324, 325, 326, 332, 333, 335, 338, 360, 361, 370, 382, 392, 394, 395, 397, 398, 400

COMMENTS

The number of terms n up to x is asymptotic to c*x/log(x)^(3/4) for an explicitly computable constant c.

FORMULA

A positive iinteger n is in this sequence if and only if all prime factors of n congruent to {3, 7, 11, 17, 19, 21, 23, 27, 29, 31, 33, 41, 43, 47, 51, 53, 57, 59, 61, 63, 69, 71, 73, 77, 87, 89, 97, 99, 101, 103, 107, 109, 111, 113, 119, 127, 131, 133, 137, 139, 141, 147, 149, 151, 153, 157, 161, 167, 171, 173, 177, 179, 181, 183, 189, 193, 201, 207, 211, 217, 219, 223, 229, 233, 237, 239, 241, 243, 249, 251, 257, 259, 261, 263, 269, 271, 277, 279, 281, 283, 287, 291, 297, 301, 303, 309, 313, 319, 327, 331, 337, 339, 341, 343, 347, 349, 353, 359, 363, 367, 369, 371, 373, 379, 381, 383, 387, 389, 393, 401, 407, 409, 411, 413, 417, 419, 421, 423, 431, 433, 443, 447, 449, 451, 457, 459, 461, 463, 467, 469, 473, 477, 479, 487, 489, 491, 493, 497, 499, 501, 503, 509, 513, 517} mod 520 occur with even exponents.

EXAMPLE

74=2*37. Using the formula above, 74 is in this sequence.

849=3*283. Using the formula above, 849 is not in this sequence, although 849=1849-1000=43^2-10*100=43^2-10*10^2 and 849==329 (mod 520).

PROG

[n: n in [0..169400] | IsRepresentablePoly(n, {10, 26})];

STATUS

proposed

editing

#8 by Jovan Radenkovicc at Fri Nov 22 10:40:41 EST 2024
STATUS

editing

proposed

Discussion
Sat Nov 23
01:32
Joerg Arndt: couldn't you just change [n: n in [0..169] to [n: n in [0..400] to get more terms?