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

A299150 Denominators of the positive solution to n = Sum_{d|n} a(d) * a(n/d).

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 2, 2, 8, 2, 2, 4, 2, 2, 4, 8, 2, 8, 2, 4, 4, 2, 2, 4, 8, 2, 16, 4, 2, 4, 2, 8, 4, 2, 4, 16, 2, 2, 4, 4, 2, 4, 2, 4, 16, 2, 2, 16, 8, 8, 4, 4, 2, 16, 4, 4, 4, 2, 2, 8, 2, 2, 16, 16, 4, 4, 2, 4, 4, 4, 2, 16, 2, 2, 16, 4, 4, 4, 2, 16, 128, 2, 2
Offset: 1

Views

Author

Gus Wiseman, Feb 03 2018

Keywords

Examples

			Sequence begins: 1, 1, 3/2, 3/2, 5/2, 3/2, 7/2, 5/2, 27/8, 5/2, 11/2, 9/4, 13/2, 7/2.

Links

Crossrefs

Cf. A000010, A003958, A005187, A006519, A007431, A011371, A018804, A023900, A029935, A037445, A046643, A046644, A165825, A257098, A298971, A299119, A299149 (numerators), A299151, A317848, A317929, A317932, A318314, A318512, A318653, A318681.
Cf. A318440 (the 2-adic valuation).

Programs

  • Mathematica
    nn=50;
sys=Table[n==Sum[a[d]*a[n/d],{d,Divisors[n]}],{n,nn}];
Denominator[Array[a,nn]/.Solve[sys,Array[a,nn]][[2]]]
f[p_, e_] := 2^((1 + Mod[p, 2])*e - DigitCount[e, 2, 1]); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Apr 28 2023 *)
  • PARI
    a(n)={my(v=factor(n)[,2]); denominator(n*prod(i=1, #v, my(e=v[i]); binomial(2*e, e)/4^e))} \\ Andrew Howroyd, Aug 09 2018
  • PARI
    A299150(n) = { my(f = factor(n), m=1); for(i=1, #f~, m *= 2^(((1+(f[i,1]%2))*f[i,2]) - hammingweight(f[i,2]))); (m); }; \\ Antti Karttunen, Sep 03 2018
  • PARI
    for(n=1, 100, print1(denominator(direuler(p=2, n, 1/(1-p*X)^(1/2))[n]), ", ")) \\ Vaclav Kotesovec, May 08 2025

Formula

a(n) = denominator(n*A317848(n)/A165825(n)) = A165825(n)/(A037445(n) * A006519(n)). - Andrew Howroyd, Aug 09 2018
a(n) = A046644(n)/A006519(n). - Andrew Howroyd and Antti Karttunen, Aug 30 2018
From Antti Karttunen, Sep 03 2018: (Start)
a(n) = 2^A318440(n).
Multiplicative with a(2^e) = 2^A011371(e), a(p^e) = 2^A005187(e) for odd primes p.
Multiplicative with a(p^e) = 2^(((1+A000035(p))*e)-A000120(e)) for all primes p.
(End)

Extensions

Keyword:mult added by Andrew Howroyd, Aug 09 2018

A317930 Numerators of rational valued sequence whose Dirichlet convolution with itself yields A234840, which is a multiplicative permutation of natural numbers.

Original entry on oeis.org

1, 3, 1, 27, 19, 3, 61, 135, 3, 57, 11, 27, 281, 183, 19, 2835, 101, 9, 5, 513, 61, 33, 263, 135, 1083, 843, 5, 1647, 29, 57, 59, 15309, 11, 303, 1159, 81, 1811, 15, 281, 2565, 1091, 183, 157, 297, 57, 789, 409, 2835, 11163, 3249, 101, 7587, 541, 15, 209, 8235, 5, 87, 31, 513, 7, 177, 183, 168399, 5339, 33, 1013, 2727
Offset: 1

Views

Author

Antti Karttunen, Aug 23 2018

Keywords

Comments

Multiplicative because A234840 is.
Question: Are all terms positive? No negative terms in range 1 .. 2^17. Also (checked for n <= 2^17) the denominators seem to be given by A317932.

Links

Crossrefs

Cf. A234840, A317932 (seems to give denominators, see A261179).
Cf. also A317929.

Programs

  • PARI
    up_to = 16384;
A234840(n) = if(n<=1,n,my(f = factor(n)); for(i=1, #f~, if(2==f[i,1], f[i,1]++, if(3==f[i,1], f[i,1]--, f[i,1] = prime(-1+A234840(1+primepi(f[i,1])))))); factorback(f)); \\ Antti Karttunen, Aug 23 2018
DirSqrt(v) = {my(n=#v, u=vector(n)); u[1]=1; for(n=2, n, u[n]=(v[n]/v[1] - sumdiv(n, d, if(d>1&&dA317937.
v317930aux = DirSqrt(vector(up_to, n, A234840(n)));
A317930(n) = numerator(v317930aux[n]);

Formula

a(n) = numerator of f(n), where f(1) = 1, f(n) = (1/2) * (A234840(n) - Sum_{d|n, d>1, d 1.

A318664 Numerators of the sequence whose Dirichlet convolution with itself yields A064664, the inverse permutation of EKG-sequence.

Original entry on oeis.org

1, 1, 5, 1, 5, -1, 7, 3, -1, -1, 10, 3, 14, -1, -7, 5, 33, 59, 37, 9, -10, -1, 43, -1, -1, -1, 181, 13, 57, 89, 61, 15, -29, -1, -45, 31, 67, -1, -41, 1, 37, 129, 81, 11, 301, -1, 89, 21, 1, 26, -97, 10, 50, -93, -47, -5, -109, -1, 107, -33, 115, -1, 411, 15, -43, 201, 64, 33, -127, 56, 67, 181, 69, -1, 283, 35, -31, 255, 151, 7
Offset: 1

Views

Author

Antti Karttunen, Sep 01 2018

Keywords

Links

Crossrefs

Cf. A064664, A304526, A304527, A305293, A305294, A318665 (denominators).
Cf. also A317929, A317930.

Programs

  • PARI
    v064413 = readvec("b064413_upto65539_terms_only.txt"); \\ From b-file of A064413 prepared beforehand.
A064413(n) = v064413[n];
m064664 = Map();
for(n=1,65539,mapput(m064664,A064413(n),n));
A064664(n) = mapget(m064664,n);
up_to = (2^14);
DirSqrt(v) = {my(n=#v, u=vector(n)); u[1]=1; for(n=2, n, u[n]=(v[n]/v[1] - sumdiv(n, d, if(d>1&&dA317937.
v318664_65 = DirSqrt(vector(up_to, n, A064664(n)));
A318664(n) = numerator(v318664_65[n]);
A318665(n) = denominator(v318664_65[n]);

Formula

a(n) = numerator of f(n), where f(1) = 1, f(n) = (1/2) * (A064664(n) - Sum_{d|n, d>1, d 1.
For n >= 2, a(2*A000040(n)) = -1.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.