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.

User: Mateusz Winiarski

Mateusz Winiarski's wiki page.

Mateusz Winiarski has authored 2 sequences.

A333443 Numbers k such that both k and k+1 are sums of two positive squares in 2 or more ways.

Original entry on oeis.org

985, 1585, 1768, 1780, 2249, 2329, 2500, 2929, 3280, 3649, 3977, 4264, 4329, 4705, 4849, 5017, 5044, 5065, 5140, 5161, 5512, 5617, 5625, 6340, 6409, 6697, 7240, 7684, 7785, 7956, 7969, 8020, 8065, 8320, 8584, 8905, 9089, 9265, 9529, 9553, 9593, 9700, 9809
Offset: 1

Author

Mateusz Winiarski, Mar 21 2020

Keywords

Comments

Numbers k such that both k and k+1 belong to A007692.

Examples

			985 is a term since 12^2 + 29^2 = 16^2 + 27^2 = 985 and 5^2 + 31^2 = 19^2 + 25^2 = 986.
625 is not a term because 626 cannot be written as the sum of two positive squares in more than one way.
		

Crossrefs

Subsequence of A007692.

Programs

  • Mathematica
    ok[n_] := Length@ IntegerPartitions[n, {2}, Range[Sqrt@ n]^2] >= 2; Select[ Range@ 10000, ok[#] && ok[#+1] &] (* Giovanni Resta, Mar 24 2020 *)
  • Python
    n=100
    t=[]
    prev=0
    A333443=[]
    for i in range(1,n+1):
        t.append(i*i)
    for j in range(n**2):
        n=0
        for k in t[:j+1]:
            if j-k in t and k<=j-k:
                n=n+1
                if n>1:
                    if j-prev==1:
                        A333443.append(j-1)
                    prev=j

A333499 Number of numbers the sum of whose digits' factorials equals n.

Original entry on oeis.org

2, 3, 7, 17, 41, 100, 242, 587, 1423, 3450, 8364, 20278, 49162, 119189, 288963, 700565, 1698457, 4117757, 9983133, 24203212, 58678520, 142260817, 344898611, 836175797, 2027233339, 4914845690, 11915603246, 28888313016, 70037127930, 169798744773, 411661851057, 998037293164
Offset: 1

Author

Mateusz Winiarski, Mar 24 2020

Keywords

Comments

Also number of occurrences of n in A061602.
All numbers whose sum of digits' factorials equals n are less than or equal to R_n (A002275).
10^n has sum of factorial of the digits equal to n, so all terms are greater than zero.

Examples

			a(2)=3 because there are 3 numbers whose sum of factorials of the digits equals 2: 2, 10, 11.
		

Crossrefs

Programs

  • Mathematica
    permC[w_] := Length[w]!/Times @@ ((Last /@ Tally[w])!); a[1]=2; a[n_] := Block[{s = 0, w, f = {1}}, While[Last[f] < n, AppendTo[f, Last[f] (Length[f] + 1)]]; Do[ p = IntegerPartitions[k, {1, k}, f]; Do[ If[k == n, s += permC[q], w = Join[q, 0 Range[n - k]]; s += permC[w] - permC[Most[w]]], {q, p}], {k, n}]; s]; Array[a, 32] (* Giovanni Resta, Mar 24 2020 *)

Extensions

More terms from Giovanni Resta, Mar 24 2020