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

A048931 Numbers that are the sum of 6 positive cubes in exactly 3 ways.

Original entry on oeis.org

221, 254, 369, 411, 443, 469, 495, 502, 576, 595, 600, 648, 658, 684, 704, 711, 720, 739, 746, 753, 760, 765, 767, 772, 774, 779, 786, 793, 811, 818, 828, 835, 844, 854, 863, 866, 874, 880, 884, 886, 892, 893, 899, 905, 910, 919, 928, 929, 935, 936, 937
Offset: 1

Views

Author

Keywords

Comments

It appears that this sequence has 1141 terms, the last of which is 26132. - Donovan Johnson, Jan 09 2013

Examples

			221 is in the sequence since 221 = 216+1+1+1+1+1 = 125+64+8+8+8+8 = 64+64+64+27+1+1
		

Crossrefs

Programs

  • Mathematica
    Reap[For[n = 1, n <= 1000, n++, pr = Select[ PowersRepresentations[n, 6, 3], Times @@ # != 0 &]; If[pr != {} && Length[pr] == 3, Print[n, pr]; Sow[n]]]][[2, 1]] (* Jean-François Alcover, Jul 31 2013 *)
  • PARI
    mx=10^6; ct=vector(mx); cb=vector(99); for(i=1, 99, cb[i]=i^3); for(i1=1, 99, s1=cb[i1]; for(i2=i1, 99, s2=s1+cb[i2]; if(s2+4*cb[i2]>mx, next(2)); for(i3=i2, 99, s3=s2+cb[i3]; if(s3+3*cb[i3]>mx, next(2)); for(i4=i3, 99, s4=s3+cb[i4]; if(s4+2*cb[i4]>mx, next(2)); for(i5=i4, 99, s5=s4+cb[i5]; if(s5+cb[i5]>mx, next(2)); for(i6=i5, 99, s6=s5+cb[i6]; if(s6>mx, next(2)); ct[s6]++)))))); n=0; for(i=6, mx, if(ct[i]==3, n++; write("b048931.txt", n " " i))) /* Donovan Johnson, Jan 09 2013 */

Extensions

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Oct 02 2000

A345513 Numbers that are the sum of six cubes in four or more ways.

Original entry on oeis.org

626, 830, 837, 856, 873, 891, 947, 954, 982, 1008, 1026, 1045, 1052, 1053, 1071, 1094, 1097, 1106, 1109, 1134, 1143, 1150, 1153, 1169, 1172, 1195, 1208, 1227, 1234, 1241, 1253, 1260, 1267, 1278, 1279, 1283, 1286, 1290, 1297, 1316, 1323, 1324, 1358, 1361, 1368
Offset: 1

Views

Author

David Consiglio, Jr., Jun 20 2021

Keywords

Examples

			830 is a term because 830 = 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 8^3 = 1^3 + 3^3 + 3^3 + 5^3 + 5^3 + 6^3 = 1^3 + 3^3 + 3^3 + 3^3 + 4^3 + 7^3 = 2^3 + 2^3 + 3^3 + 3^3 + 6^3 + 6^3.
		

Crossrefs

Programs

  • Python
    from itertools import combinations_with_replacement as cwr
    from collections import defaultdict
    keep = defaultdict(lambda: 0)
    power_terms = [x**3 for x in range(1, 1000)]
    for pos in cwr(power_terms, 6):
        tot = sum(pos)
        keep[tot] += 1
        rets = sorted([k for k, v in keep.items() if v >= 4])
        for x in range(len(rets)):
            print(rets[x])

A345816 Numbers that are the sum of six fourth powers in exactly four ways.

Original entry on oeis.org

6626, 6691, 6866, 9251, 9491, 10115, 10706, 10786, 11555, 12595, 14225, 14691, 14771, 15315, 15330, 15570, 16051, 16595, 16660, 16675, 16850, 17090, 17091, 17236, 17316, 17331, 17346, 17860, 17875, 17940, 17955, 18195, 18786, 18851, 19155, 19170, 19475, 19490
Offset: 1

Views

Author

David Consiglio, Jr., Jun 26 2021

Keywords

Comments

Differs from A345561 at term 16 because 15395 = 1^4 + 1^4 + 1^4 + 6^4 + 8^4 + 10^4 = 1^4 + 2^4 + 5^4 + 8^4 + 8^4 + 9^4 = 3^4 + 4^4 + 4^4 + 7^4 + 7^4 + 10^4 = 3^4 + 5^4 + 7^4 + 8^4 + 8^4 + 8^4 = 2^4 + 2^4 + 2^4 + 3^4 + 5^4 + 11^4.

Examples

			6691 is a term because 6691 = 1^4 + 1^4 + 1^4 + 6^4 + 6^4 + 8^4 = 1^4 + 2^4 + 2^4 + 2^4 + 3^4 + 9^4 = 2^4 + 2^4 + 3^4 + 3^4 + 7^4 + 8^4 = 3^4 + 4^4 + 4^4 + 6^4 + 7^4 + 7^4.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[20000],Count[PowersRepresentations[#,6,4],?(#[[1]]>0&)]==4&] (* _Harvey P. Dale, Mar 11 2023 *)
  • Python
    from itertools import combinations_with_replacement as cwr
    from collections import defaultdict
    keep = defaultdict(lambda: 0)
    power_terms = [x**4 for x in range(1, 1000)]
    for pos in cwr(power_terms, 6):
        tot = sum(pos)
        keep[tot] += 1
        rets = sorted([k for k, v in keep.items() if v == 4])
        for x in range(len(rets)):
            print(rets[x])

A344035 Numbers that are the sum of five positive cubes in exactly four ways.

Original entry on oeis.org

1252, 1376, 1461, 1522, 1548, 1585, 1590, 1646, 1702, 1709, 1737, 1739, 1772, 1798, 1802, 1810, 1864, 1889, 1954, 1987, 2006, 2033, 2081, 2096, 2152, 2160, 2225, 2241, 2251, 2276, 2313, 2322, 2339, 2341, 2367, 2374, 2377, 2416, 2423, 2456, 2458, 2465, 2467, 2512, 2521, 2528, 2530, 2537, 2540, 2549, 2556, 2582
Offset: 1

Views

Author

David Consiglio, Jr., May 07 2021

Keywords

Comments

Differs from A344034 at term 13 because 1765 = 1^3 + 1^3 + 2^3 + 3^3 + 12^3 = 1^3 + 1^3 + 6^3 + 6^3 + 11^3 = 1^3 + 2^3 + 3^3 + 9^3 + 10^3 = 3^3 + 4^3 + 6^3 + 9^3 + 9^3 = 4^3 + 4^3 + 5^3 + 8^3 + 10^3

Examples

			1461 is a member of this sequence because 1461 = 1^3 + 1^3 + 1^3 + 9^3 + 9^3 = 1^3 + 1^3 + 4^3 + 4^3 + 11^3 = 3^3 + 3^3 + 4^3 + 7^3 + 10^3 = 6^3 + 6^3 + 7^3 + 7^3 + 7^3
		

Crossrefs

Programs

  • Mathematica
    s5pcQ[n_]:=Length[Select[PowersRepresentations[n,5,3],FreeQ[#,0]&]]==4; Select[Range[ 3000],s5pcQ] (* Harvey P. Dale, Sep 15 2024 *)
  • Python
    from itertools import combinations_with_replacement as cwr
    from collections import defaultdict
    keep = defaultdict(lambda: 0)
    power_terms = [x**3 for x in range(1,50)]
    for pos in cwr(power_terms,5):
        tot = sum(pos)
        keep[tot] += 1
    rets = sorted([k for k,v in keep.items() if v == 4])
    for x in range(len(rets)):
        print(rets[x])

A345767 Numbers that are the sum of six cubes in exactly five ways.

Original entry on oeis.org

1045, 1169, 1241, 1260, 1384, 1432, 1440, 1495, 1530, 1539, 1549, 1556, 1558, 1584, 1594, 1602, 1612, 1617, 1640, 1654, 1657, 1675, 1703, 1712, 1715, 1719, 1729, 1736, 1745, 1747, 1754, 1771, 1780, 1792, 1801, 1803, 1806, 1810, 1818, 1825, 1827, 1834, 1843
Offset: 1

Views

Author

David Consiglio, Jr., Jun 26 2021

Keywords

Comments

Differs from A345514 at term 5 because 1377 = 1^3 + 1^3 + 2^3 + 7^3 + 8^3 + 8^3 = 1^3 + 1^3 + 5^3 + 5^3 + 5^3 + 10^3 = 1^3 + 2^3 + 3^3 + 5^3 + 6^3 + 10^3 = 1^3 + 6^3 + 6^3 + 6^3 + 6^3 + 8^3 = 3^3 + 3^3 + 5^3 + 7^3 + 7^3 + 8^3 = 3^3 + 4^3 + 5^3 + 6^3 + 6^3 + 9^3.

Examples

			1169 is a term because 1169 = 1^3 + 2^3 + 2^3 + 3^3 + 4^3 + 9^3 = 1^3 + 2^3 + 5^3 + 5^3 + 5^3 + 7^3 = 1^3 + 3^3 + 4^3 + 4^3 + 4^3 + 8^3 = 2^3 + 3^3 + 3^3 + 4^3 + 5^3 + 8^3 = 3^3 + 3^3 + 3^3 + 3^3 + 7^3 + 7^3.
		

Crossrefs

Programs

  • Python
    from itertools import combinations_with_replacement as cwr
    from collections import defaultdict
    keep = defaultdict(lambda: 0)
    power_terms = [x**3 for x in range(1, 1000)]
    for pos in cwr(power_terms, 6):
        tot = sum(pos)
        keep[tot] += 1
        rets = sorted([k for k, v in keep.items() if v == 5])
        for x in range(len(rets)):
            print(rets[x])

A345776 Numbers that are the sum of seven cubes in exactly four ways.

Original entry on oeis.org

470, 496, 503, 603, 634, 653, 659, 685, 690, 692, 711, 712, 747, 751, 754, 761, 766, 773, 775, 777, 780, 783, 787, 792, 794, 812, 813, 829, 831, 836, 842, 843, 859, 867, 871, 875, 883, 885, 890, 892, 899, 901, 904, 906, 907, 911, 913, 918, 919, 927, 930, 936
Offset: 1

Views

Author

David Consiglio, Jr., Jun 26 2021

Keywords

Comments

Differs from A345522 at term 5 because 627 = 1^3 + 1^3 + 1^3 + 1^3 + 4^3 + 6^3 + 7^3 = 1^3 + 1^3 + 5^3 + 5^3 + 5^3 + 5^3 + 5^3 = 1^3 + 2^3 + 3^3 + 5^3 + 5^3 + 5^3 + 6^3 = 1^3 + 3^3 + 4^3 + 4^3 + 4^3 + 4^3 + 7^3 = 2^3 + 2^3 + 3^3 + 3^3 + 5^3 + 6^3 + 6^3.
Likely finite.

Examples

			496 is a term because 496 = 1^3 + 1^3 + 1^3 + 3^3 + 4^3 + 4^3 + 5^3 = 1^3 + 1^3 + 2^3 + 3^3 + 3^3 + 5^3 + 5^3 = 1^3 + 2^3 + 2^3 + 2^3 + 3^3 + 3^3 + 6^3 = 3^3 + 3^3 + 3^3 + 3^3 + 3^3 + 4^3 + 4^3.
		

Crossrefs

Programs

  • Python
    from itertools import combinations_with_replacement as cwr
    from collections import defaultdict
    keep = defaultdict(lambda: 0)
    power_terms = [x**3 for x in range(1, 1000)]
    for pos in cwr(power_terms, 7):
        tot = sum(pos)
        keep[tot] += 1
        rets = sorted([k for k, v in keep.items() if v == 4])
        for x in range(len(rets)):
            print(rets[x])
Showing 1-6 of 6 results.