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 51-60 of 140 results. Next

A003387 Numbers that are the sum of 9 nonzero 8th powers.

Original entry on oeis.org

9, 264, 519, 774, 1029, 1284, 1539, 1794, 2049, 2304, 6569, 6824, 7079, 7334, 7589, 7844, 8099, 8354, 8609, 13129, 13384, 13639, 13894, 14149, 14404, 14659, 14914, 19689, 19944, 20199, 20454, 20709, 20964, 21219, 26249, 26504, 26759, 27014, 27269
Offset: 1

Views

Author

Keywords

Comments

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

Examples

			From _David A. Corneth_, Aug 01 2020: (Start)
5820102 is in the sequence as 5820102 = 1^8 + 1^8 + 1^8 + 1^8 + 5^8 + 5^8 + 6^8 + 6^8 + 6^8.
9960580 is in the sequence as 9960580 = 5^8 + 5^8 + 5^8 + 5^8 + 6^8 + 6^8 + 6^8 + 6^8 + 6^8.
11260068 is in the sequence as 11260068 = 1^8 + 1^8 + 2^8 + 4^8 + 5^8 + 6^8 + 6^8 + 6^8 + 7^8. (End)
		

Crossrefs

A###### (x, y): Numbers that are the form of x nonzero y-th powers.
Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

Programs

  • Maple
    A003387 := proc(nmax::integer)
        local a, x,x8,y,y8,z,z8,u,u8,v,v8,w,w8,t,t8,s,s8,r,r8 ;
        a := {} ;
        for x from 1 do
            x8 := x^8 ;
            if 9*x8 > nmax then
                break;
            end if;
            for y from x do
                y8 := y^8 ;
                if x8+8*y8 > nmax then
                    break;
                end if;
                for z from y do
                    z8 := z^8 ;
                    if x8+y8+7*z8 > nmax then
                        break;
                    end if;
                    for u from z do
                        u8 := u^8 ;
                        if x8+y8+z8+6*u8 > nmax then
                            break;
                        end if;
                        for v from u do
                            v8 := v^8 ;
                            if x8+y8+z8+u8+5*v8 > nmax then
                                break;
                            end if;
                            for w from v do
                                w8 := w^8 ;
                                if x8+y8+z8+u8+v8+4*w8 > nmax then
                                    break;
                                end if;
                                for t from w do
                                    t8 := t^8 ;
                                    if x8+y8+z8+u8+v8+w8+3*t8 > nmax then
                                        break;
                                    end if;
                                    for s from t do
                                        s8 := s^8 ;
                                        if x8+y8+z8+u8+v8+w8+t8+2*s8 > nmax then
                                            break;
                                        end if;
                                        for r from s do
                                            r8 := r^8 ;
                                            if x8+y8+z8+u8+v8+w8+t8+s8+r8 > nmax then
                                                break ;
                                            end if;
                                            if x8+y8+z8+u8+v8+w8+t8+s8+r8 <= nmax then
                                                a := a  union {x8+y8+z8+u8+v8+w8+t8+s8+r8} ;
                                            end if;
                                        end do:
                                    end do:
                                end do:
                            end do:
                        end do:
                    end do:
                end do:
            end do:
        end do:
        sort(convert(a,list)) ;
    end proc:
    nmax := 15116544 ;
    L:= A003387(nmax) ;
    LISTTOBFILE(L,"b003387.txt",1) ; # R. J. Mathar, Aug 01 2020
  • Mathematica
    M = 45711012; m = M^(1/8) // Ceiling; Reap[
    For[a = 1, a <= m, a++, For[b = a, b <= m, b++, For[c = b, c <= m, c++,
    For[d = c, d <= m, d++, For[e = d, e <= m, e++, For[f = e, f <= m, f++,
    For[g = f, g <= m, g++, For[h = g, h <= m, h++, For[i = h, i <= m, i++,
    s = a^8 + b^8 + c^8 + d^8 + e^8 + f^8 + g^8 + h^8 + i^8;
    If[s <= M, Sow[s]]]]]]]]]]]][[2, 1]] // Union (* Jean-François Alcover, Dec 01 2020 *)

Extensions

Incorrect program removed by David A. Corneth, Aug 01 2020

A003388 Sum of 10 nonzero 8th powers.

Original entry on oeis.org

10, 265, 520, 775, 1030, 1285, 1540, 1795, 2050, 2305, 2560, 6570, 6825, 7080, 7335, 7590, 7845, 8100, 8355, 8610, 8865, 13130, 13385, 13640, 13895, 14150, 14405, 14660, 14915, 15170, 19690, 19945, 20200, 20455, 20710, 20965, 21220, 21475, 26250, 26505
Offset: 1

Views

Author

Keywords

Comments

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

Examples

			From _David A. Corneth_, Aug 01 2020: (Start)
3431590 is in the sequence as 3431590 = 1^8 + 1^8 + 1^8 + 1^8 + 1^8 + 2^8 + 3^8 + 4^8 + 6^8 + 6^8.
6276517 is in the sequence as 6276517 = 1^8 + 1^8 + 2^8 + 4^8 + 5^8 + 5^8 + 5^8 + 6^8 + 6^8 + 6^8.
8045029 is in the sequence as 8045029 = 1^8 + 2^8 + 3^8 + 3^8 + 4^8 + 4^8 + 4^8 + 5^8 + 6^8 + 7^8. (End)
		

Crossrefs

A###### (x, y): Numbers that are the form of x nonzero y-th powers.
Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

Extensions

offset corrected by David A. Corneth, Aug 01 2020

A003393 Numbers that are the sum of 4 positive 9th powers.

Original entry on oeis.org

4, 515, 1026, 1537, 2048, 19686, 20197, 20708, 21219, 39368, 39879, 40390, 59050, 59561, 78732, 262147, 262658, 263169, 263680, 281829, 282340, 282851, 301511, 302022, 321193, 524290, 524801, 525312, 543972, 544483, 563654, 786433, 786944, 806115, 1048576, 1953128, 1953639
Offset: 1

Views

Author

Keywords

Comments

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

Examples

			From _David A. Corneth_, Aug 01 2020: (Start)
12964419872 is in the sequence as 12964419872 = 3^9 + 5^9 + 11^9 + 13^9.
59116436980 is in the sequence as 59116436980 = 5^9 + 6^9 + 14^9 + 15^9.
79254744137 is in the sequence as 79254744137 = 6^9 + 11^9 + 15^9 + 15^9. (End)
		

Crossrefs

A###### (x, y): Numbers that are the form of x nonzero y-th powers.
Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

Extensions

Removed incorrect program. - David A. Corneth, Aug 01 2020

A004803 Numbers that are the sum of 3 nonzero 10th powers.

Original entry on oeis.org

3, 1026, 2049, 3072, 59051, 60074, 61097, 118099, 119122, 177147, 1048578, 1049601, 1050624, 1107626, 1108649, 1166674, 2097153, 2098176, 2156201, 3145728, 9765627, 9766650, 9767673, 9824675, 9825698, 9883723, 10814202, 10815225, 10873250
Offset: 1

Views

Author

Keywords

Comments

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

Examples

			From _David A. Corneth_, Aug 01 2020: (Start)
17258390288153 is in the sequence as 17258390288153 = 14^10 + 14^10 + 21^10.
42930989049225 is in the sequence as 42930989049225 = 19^10 + 20^10 + 22^10.
323760702520401 is in the sequence as 323760702520401 = 23^10 + 26^10 + 26^10. (End)
		

Crossrefs

A###### (x, y): Numbers that are the form of x nonzero y-th powers.
Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

Programs

  • Mathematica
    kmax = 9*10^15; (* max term *)
    m = kmax^(1/10) // Ceiling;
    Table[k = x^10 + y^10 + z^10; If[k <= kmax, k, Nothing], {x, 1, m}, {y, x, m}, {z, y, m}] // Flatten // Union (* Jean-François Alcover, Jul 19 2017, updated May 02 2023 *)

Extensions

Removed incorrect program. - David A. Corneth, Aug 01 2020

A004804 Numbers that are the sum of 4 nonzero 10th powers.

Original entry on oeis.org

4, 1027, 2050, 3073, 4096, 59052, 60075, 61098, 62121, 118100, 119123, 120146, 177148, 178171, 236196, 1048579, 1049602, 1050625, 1051648, 1107627, 1108650, 1109673, 1166675, 1167698, 1225723, 2097154, 2098177, 2099200, 2156202, 2157225
Offset: 1

Views

Author

Keywords

Comments

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

Examples

			From _David A. Corneth_, Aug 01 2020: (Start)
65969099123 is in the sequence as 65969099123 = 7^10 + 7^10 + 9^10 + 12^10.
1099804917226 is in the sequence as 1099804917226 = 4^10 + 5^10 + 7^10 + 16^10.
1164925542026 is in the sequence as 1164925542026 = 5^10 + 9^10 + 12^10 + 16^10. (End)
		

Crossrefs

A###### (x, y): Numbers that are the form of x nonzero y-th powers.
Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

Programs

  • Mathematica
    k = 4; p = 10; amax = 3*10^6; bmax = amax^(1/p) // Ceiling; Clear[b]; b[0] = 1; Select[Table[Total[Array[b, k]^p], {b[1], b[0], bmax}, Evaluate[ Sequence @@ Table[{b[j], b[j-1], bmax}, {j, 1, k}]]] // Flatten // Union, # <= amax&] (* Jean-François Alcover, Jul 19 2017 *)

Extensions

Removed incorrect program. - David A. Corneth, Aug 01 2020

A004805 Numbers that are the sum of 5 positive 10th powers.

Original entry on oeis.org

5, 1028, 2051, 3074, 4097, 5120, 59053, 60076, 61099, 62122, 63145, 118101, 119124, 120147, 121170, 177149, 178172, 179195, 236197, 237220, 295245, 1048580, 1049603, 1050626, 1051649, 1052672, 1107628, 1108651, 1109674, 1110697, 1166676, 1167699, 1168722, 1225724, 1226747
Offset: 1

Views

Author

Keywords

Comments

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

Examples

			From _David A. Corneth_, Aug 01 2020: (Start)
10352707051 is in the sequence as 10352707051 = 1^10 + 5^10 + 6^10 + 7^10 + 10^10.
59130893253 is in the sequence as 59130893253 = 7^10 + 9^10 + 9^10 + 11^10 + 11^10.
69011865378 is in the sequence as 69011865378 = 6^10 + 6^10 + 9^10 + 9^10 + 12^10. (End)
		

Crossrefs

A###### (x, y): Numbers that are the form of x nonzero y-th powers.
Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

Programs

  • Mathematica
    k = 5; p = 10; amax = 2*10^6; bmax = amax^(1/p) // Ceiling; Clear[b]; b[0] = 1; Select[Table[Total[Array[b, k]^p], {b[1], b[0], bmax}, Evaluate[ Sequence @@ Table[{b[j], b[j - 1], bmax}, {j, 1, k}]]] //Flatten // Union, # <= amax&] (* Jean-François Alcover, Jul 19 2017 *)

Extensions

Removed incorrect program. - David A. Corneth, Aug 01 2020

A004814 Numbers that are the sum of 3 positive 11th powers.

Original entry on oeis.org

3, 2050, 4097, 6144, 177149, 179196, 181243, 354295, 356342, 531441, 4194306, 4196353, 4198400, 4371452, 4373499, 4548598, 8388609, 8390656, 8565755, 12582912, 48828127, 48830174, 48832221, 49005273, 49007320, 49182419, 53022430
Offset: 1

Views

Author

Keywords

Comments

As the order of addition doesn't matter we can assume terms are in nondecreasing order. - David A. Corneth, Aug 01 2020

Examples

			From _David A. Corneth_, Aug 01 2020: (Start)
204800049005272 is in the sequence as 204800049005272 = 3^11 + 5^11 + 20^11.
2518268235958260 is in the sequence as 2518268235958260 = 16^11 + 19^11 + 25^11.
3786934745885995 is in the sequence as 3786934745885995 = 10^11 + 19^11 + 26^11. (End)
		

Crossrefs

A###### (x, y): Numbers that are the form of x nonzero y-th powers.
Cf. A000404 (2, 2), A000408 (3, 2), A000414 (4, 2), A003072 (3, 3), A003325 (3, 2), A003327 (4, 3), A003328 (5, 3), A003329 (6, 3), A003330 (7, 3), A003331 (8, 3), A003332 (9, 3), A003333 (10, 3), A003334 (11, 3), A003335 (12, 3), A003336 (2, 4), A003337 (3, 4), A003338 (4, 4), A003339 (5, 4), A003340 (6, 4), A003341 (7, 4), A003342 (8, 4), A003343 (9, 4), A003344 (10, 4), A003345 (11, 4), A003346 (12, 4), A003347 (2, 5), A003348 (3, 5), A003349 (4, 5), A003350 (5, 5), A003351 (6, 5), A003352 (7, 5), A003353 (8, 5), A003354 (9, 5), A003355 (10, 5), A003356 (11, 5), A003357 (12, 5), A003358 (2, 6), A003359 (3, 6), A003360 (4, 6), A003361 (5, 6), A003362 (6, 6), A003363 (7, 6), A003364 (8, 6), A003365 (9, 6), A003366 (10, 6), A003367 (11, 6), A003368 (12, 6), A003369 (2, 7), A003370 (3, 7), A003371 (4, 7), A003372 (5, 7), A003373 (6, 7), A003374 (7, 7), A003375 (8, 7), A003376 (9, 7), A003377 (10, 7), A003378 (11, 7), A003379 (12, 7), A003380 (2, 8), A003381 (3, 8), A003382 (4, 8), A003383 (5, 8), A003384 (6, 8), A003385 (7, 8), A003387 (9, 8), A003388 (10, 8), A003389 (11, 8), A003390 (12, 8), A003391 (2, 9), A003392 (3, 9), A003393 (4, 9), A003394 (5, 9), A003395 (6, 9), A003396 (7, 9), A003397 (8, 9), A003398 (9, 9), A003399 (10, 9), A004800 (11, 9), A004801 (12, 9), A004802 (2, 10), A004803 (3, 10), A004804 (4, 10), A004805 (5, 10), A004806 (6, 10), A004807 (7, 10), A004808 (8, 10), A004809 (9, 10), A004810 (10, 10), A004811 (11, 10), A004812 (12, 10), A004813 (2, 11), A004814 (3, 11), A004815 (4, 11), A004816 (5, 11), A004817 (6, 11), A004818 (7, 11), A004819 (8, 11), A004820 (9, 11), A004821 (10, 11), A004822 (11, 11), A004823 (12, 11), A047700 (5, 2).

Extensions

Removed incorrect program. - David A. Corneth, Aug 01 2020

A004999 Sums of two nonnegative cubes.

Original entry on oeis.org

0, 1, 2, 8, 9, 16, 27, 28, 35, 54, 64, 65, 72, 91, 125, 126, 128, 133, 152, 189, 216, 217, 224, 243, 250, 280, 341, 343, 344, 351, 370, 407, 432, 468, 512, 513, 520, 539, 559, 576, 637, 686, 728, 729, 730, 737, 756, 793, 854, 855, 945, 1000, 1001
Offset: 1

Views

Author

Keywords

Crossrefs

Subsequence of A045980; A003325 is a subsequence.
Cf. A000578, A004825, A010057, A373972 (characteristic function).
Indices of nonzero terms in A025446.

Programs

  • Haskell
    a004999 n = a004999_list !! (n-1)
    a004999_list = filter c2 [1..] where
       c2 x = any (== 1) $ map (a010057 . fromInteger) $
                           takeWhile (>= 0) $ map (x -) $ tail a000578_list
    -- Reinhard Zumkeller, Dec 20 2013
  • Mathematica
    Union[(#[[1]]^3+#[[2]]^3)&/@Tuples[Range[0,20],{2}]] (* Harvey P. Dale, Dec 04 2010 *)
  • PARI
    is(n)=my(k1=ceil((n-1/2)^(1/3)), k2=floor((4*n+1/2)^(1/3)), L); fordiv(n,d,if(d>=k1 && d<=k2 && denominator(L=(d^2-n/d)/3)==1 && issquare(d^2-4*L), return(1))); 0
    list(lim)=my(v=List());for(x=0,(lim+.5)^(1/3),for(y=0,min(x,(lim-x^3)^(1/3)),listput(v,x^3+y^3))); vecsort(Vec(v),,8) \\ Charles R Greathouse IV, Jun 12 2012
    
  • PARI
    is(n)=my(L=sqrtnint(n-1,3)+1,U=sqrtnint(4*n,3));fordiv(n,m,if(L<=m&m<=U,my(ell=(m^2-n/m)/3);if(denominator(ell)==1&&issquare(m^2-4*ell),return(1))));0 \\ Charles R Greathouse IV, Apr 16 2013
    
  • PARI
    T=thueinit('z^3+1);
    is(n)=n==0 || #select(v->min(v[1],v[2])>=0, thue(T,n))>0 \\ Charles R Greathouse IV, Nov 29 2014
    

A159843 Sums of two rational cubes.

Original entry on oeis.org

1, 2, 6, 7, 8, 9, 12, 13, 15, 16, 17, 19, 20, 22, 26, 27, 28, 30, 31, 33, 34, 35, 37, 42, 43, 48, 49, 50, 51, 53, 54, 56, 58, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 75, 78, 79, 84, 85, 86, 87, 89, 90, 91, 92, 94, 96, 97, 98, 103, 104, 105, 106, 107, 110, 114, 115, 117
Offset: 1

Views

Author

Steven Finch, Apr 23 2009

Keywords

Comments

Conjectured asymptotic (based on the random matrix theory) is given in Cohen (2007) on p. 378.
The prime elements are listed in A166246. - Max Alekseyev, Oct 10 2009
Alpöge et al. prove 'that the density of integers expressible as the sum of two rational cubes is strictly positive and strictly less than 1.' The authors remark that it is natural to conjecture that these integers 'have natural density exactly 1/2.' - Peter Luschny, Nov 30 2022
Jha, Majumdar, & Sury prove that every nonzero residue class mod p (for prime p) has infinitely many elements, as do 1 and 8 mod 9. - Charles R Greathouse IV, Jan 24 2023
Alpöge, Bhargava, & Shnidman prove that the lower density of this sequence is at least 2/21 and its upper density is at most 5/6. - Charles R Greathouse IV, Feb 15 2023

References

  • H. Cohen, Number Theory. I, Tools and Diophantine Equations, Springer-Verlag, 2007, p. 379.

Crossrefs

Complement of A185345.
Subsequences include A045980, A004999, and A003325.

Programs

  • Mathematica
    (* A naive program with a few pre-computed terms *) nmax = 117; xmax = 2000; CubeFreePart[n_] := Times @@ Power @@@ ({#[[1]], Mod[#[[2]], 3]} & /@ FactorInteger[n]); nn = Join[{1}, Reap[ Do[n = CubeFreePart[x*y*(x + y)]; If[1 < n <= nmax, Sow[n]], {x, 1, xmax}, {y, x, xmax}]][[2, 1]] // Union]; A159843 = Select[ Union[nn, nn*2^3, nn*3^3, nn*4^3, {17, 31, 53, 67, 71, 79, 89, 94, 97, 103, 107}], # <= nmax &] (* Jean-François Alcover, Apr 03 2012 *)
  • PARI
    is(n, f=factor(n))=my(c=prod(i=1, #f~, f[i, 1]^(f[i, 2]\3)), r=n/c^3, E=ellinit([0, 16*r^2]), eri=ellrankinit(E), mwr=ellrank(eri), ar); if(r<3 || mwr[1], return(1)); if(mwr[2]<1, return(0)); ar=ellanalyticrank(E)[1]; if(ar<2, return(ar)); for(effort=1,99, mwr=ellrank(eri,effort); if(mwr[1]>0, return(1), mwr[2]<1, return(0))); "yes under BSD conjecture" \\ Charles R Greathouse IV, Dec 02 2022

Formula

A cubefree integer c>2 is in this sequence iff the elliptic curve y^2=x^3+16*c^2 has positive rank. - Max Alekseyev, Oct 10 2009

A002376 Least number of positive cubes needed to sum to n.

Original entry on oeis.org

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

Views

Author

Keywords

Comments

No terms are greater than 9, see A002804. - Charles R Greathouse IV, Aug 01 2013

References

  • D. H. Lehmer, Guide to Tables in the Theory of Numbers. Bulletin No. 105, National Research Council, Washington, DC, 1941, p. 81.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
  • A. R. Zornow, De compositione numerorum e cubis integris positivus, J. Reine Angew. Math., 14 (1835), 276-280.

Crossrefs

Cf. A000578, A003325 (numbers requiring 2 cubes), A047702 (numbers requiring 3 cubes), A047703 (numbers requiring 4 cubes), A047704 (numbers requiring 5 cubes), A046040 (numbers requiring 6 cubes), A018890 (numbers requiring 7 cubes), A018888 (numbers requiring 8 or 9 cubes), A055401 (cubes needed by greedy algorithm).

Programs

  • Maple
    f:= proc(n) option remember;
      min(seq(procname(n - i^3)+1, i=1..floor(n^(1/3))))
    end proc:
    f(0):= 0:
    map(f, [$1..100]); # Robert Israel, Jun 30 2017
  • Mathematica
    CubesCnt[n_] := Module[{k = 1}, While[Length[PowersRepresentations[n, k, 3]] == 0, k++]; k]; Array[CubesCnt, 100] (* T. D. Noe, Apr 01 2011 *)
  • Python
    from itertools import count
    from sympy.solvers.diophantine.diophantine import power_representation
    def A002376(n):
        if n == 1: return 1
        for k in count(1):
            try:
                next(power_representation(n,3,k))
            except:
                continue
            return k # Chai Wah Wu, Jun 25 2024

Formula

The g.f. conjectured by Simon Plouffe in his 1992 dissertation,
-(-1-z-z^2-z^3-z^4-z^5-z^6+6*z^7)/(z+1)/(z^2+1)/(z^4+1)/(z-1)^2, is incorrect: the first wrong coefficient is that of z^26. - Robert Israel, Jun 30 2017

Extensions

More terms from Arlin Anderson (starship1(AT)gmail.com)
Previous Showing 51-60 of 140 results. Next