A300837 -id:A300837 - cp's OEIS frontend

A333619 Numbers that are divisible by the total number of 1's in the Zeckendorf representations of all their divisors (A300837).

1, 2, 4, 10, 15, 18, 20, 25, 44, 55, 56, 63, 70, 78, 80, 96, 108, 126, 128, 190, 275, 324, 338, 341, 416, 442, 451, 484, 494, 517, 520, 550, 637, 682, 720, 726, 736, 760, 780, 781, 803, 816, 845, 946, 990, 1088, 1111, 1113, 1199, 1235, 1239, 1311, 1426, 1441

Offset: 1

Amiram Eldar, Mar 29 2020

			4 is a term since its divisors are {1, 2, 4}, their Zeckendorf representations (A014417) are {1, 10, 101}, and their sum of sums of digits is 1 + (1 + 0) + (1 + 0 + 1) = 4 which is a divisor of 4.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A007895, A014417, A093705, A300837, A328208, A333617, A333620.

zeckDigSum[n_] := Length[DeleteCases[NestWhileList[# - Fibonacci[Floor[Log[Sqrt[5] * # + 3/2]/Log[GoldenRatio]]] &, n, # > 1 &], 0]];
zeckDivDigSum[n_] := DivisorSum[n, zeckDigSum[#] &];
Select[Range[10^3], Divisible[#, zeckDivDigSum[#]] &]

A333621 Numbers that are divisible by the total number of 1's in both the Zeckendorf and the dual Zeckendorf representations of all their divisors (A300837 and A333618).

Original entry on oeis.org

1, 2, 4, 126, 416, 442, 3025, 4588, 9243, 10428, 11900, 15070, 18176, 19436, 20532, 26956, 28582, 32108, 33028, 35278, 35929, 37634, 47678, 50386, 61952, 69254, 74578, 88984, 93534, 95120, 96334, 100326, 102297, 142894, 144039, 145768, 147664, 152817, 163125, 183002

Offset: 1

Amiram Eldar, Mar 29 2020

			126 is a term since A300837(126) = 21 and A333618(126) = 7 are both divisors of 126.

Intersection of A333619 and A333620.

Cf. A007895, A112310, A300837, A330711, A333617, A333618.

zeckDigSum[n_] := Length[DeleteCases[NestWhileList[# - Fibonacci[Floor[Log[Sqrt[5] * # + 3/2]/Log[GoldenRatio]]] &, n, # > 1 &], 0]];
zeckDivDigSum[n_] := DivisorSum[n, zeckDigSum[#] &];
fibTerms[n_] := Module[{k = Ceiling[Log[GoldenRatio, n*Sqrt[5]]], t = n, fr = {}}, While[k > 1, If[t >= Fibonacci[k], AppendTo[fr, 1]; t = t - Fibonacci[k], AppendTo[fr, 0]]; k--]; fr];
dualZeckSum[n_] := Module[{v = fibTerms[n]}, nv = Length[v]; i = 1; While[i <= nv - 2, If[v[[i]] == 1 && v[[i + 1]] == 0 && v[[i + 2]] == 0, v[[i]] = 0; v[[i + 1]] = 1; v[[i + 2]] = 1; If[i > 2, i -= 3]]; i++]; i = Position[v, _?(# > 0 &)]; If[i == {}, 0, Total[v[[i[[1, 1]] ;; -1]]]]];
dualZeckDivDigSum[n_] := DivisorSum[n, dualZeckSum[#] &];
Select[Range[10^4], Divisible[#, zeckDivDigSum[#]] && Divisible[#, dualZeckDivDigSum[#]] &]

A304092 Number of Lucas numbers (A000032: 2, 1, 3, 4, 7, 11, ...) dividing n.

Original entry on oeis.org

1, 2, 2, 3, 1, 3, 2, 3, 2, 2, 2, 4, 1, 3, 2, 3, 1, 4, 1, 3, 3, 3, 1, 4, 1, 2, 2, 4, 2, 3, 1, 3, 3, 2, 2, 5, 1, 2, 2, 3, 1, 4, 1, 4, 2, 2, 2, 4, 2, 2, 2, 3, 1, 4, 2, 4, 2, 3, 1, 4, 1, 2, 3, 3, 1, 4, 1, 3, 2, 3, 1, 5, 1, 2, 2, 4, 3, 3, 1, 3, 2, 2, 1, 5, 1, 2, 3, 4, 1, 4, 2, 3, 2, 3, 1, 4, 1, 3, 3, 3, 1, 3, 1, 3, 3

Offset: 1

Antti Karttunen, May 13 2018

nonn

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A000032, A093540, A102460, A304091, A304094, A304096.

Cf. also A005086, A300837.

Module[{nn=11,luc},luc=LucasL[Range[0,nn]];Table[Count[n/luc,?IntegerQ],{n,Max[luc]}]] (* _Harvey P. Dale, Jul 01 2023 *)

A102460(n) = { my(u1=1,u2=3,old_u1); if(n<=2,sign(n),while(n>u2,old_u1=u1;u1=u2;u2=old_u1+u2);(u2==n)); };
A304092(n) = sumdiv(n,d,A102460(d));

a(n) = Sum_{d|n} A102460(d).
a(n) = A304091(n) + A102460(n).
a(n) = A304094(n) + A059841(n) = A304096(n) + A059841(n) + A079978(n) + 1.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = A093540 + 1/2 = 2.462858... . - Amiram Eldar, Dec 31 2023

A300836 a(n) is the total number of terms (1-digits) in Zeckendorf representation of all proper divisors of n.

Original entry on oeis.org

0, 1, 1, 2, 1, 3, 1, 4, 2, 3, 1, 7, 1, 4, 3, 5, 1, 7, 1, 7, 4, 4, 1, 11, 2, 3, 4, 8, 1, 10, 1, 7, 4, 5, 4, 14, 1, 5, 3, 11, 1, 10, 1, 8, 7, 4, 1, 15, 3, 8, 5, 7, 1, 12, 4, 12, 5, 4, 1, 21, 1, 5, 7, 10, 3, 13, 1, 8, 4, 11, 1, 19, 1, 4, 8, 10, 5, 10, 1, 16, 7, 5, 1, 20, 5, 5, 4, 12, 1, 20, 4, 10, 5, 4, 5, 21, 1, 9, 10, 16, 1, 13, 1, 11, 10

Offset: 1

Antti Karttunen, Mar 18 2018

nonn

			For n=12, its proper divisors are 1, 2, 3, 4 and 6. Zeckendorf-representations (A014417) of these numbers are 1, 10, 100, 101 and 1001. Total number of 1's present is 7, thus a(12) = 7.

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A000045, A007895, A014417, A072649, A300834, A300837.

Cf. also A292257, A293435.

A072649(n) = { my(m); if(n<1, 0, m=0; until(fibonacci(m)>n, m++); m-2); }; \\ From A072649
A007895(n) = { my(s=0); while(n>0, s++; n -= fibonacci(1+A072649(n))); (s); }
A300836(n) = sumdiv(n,d,(dA007895(d));

a(n) = Sum_{d|n, dA007895(d).
a(n) = A300837(n) - A007895(n).
a(n) = A001222(A300834(n)).
For all n >=1, a(n) >= A293435(n).

A304105 Restricted growth sequence transform of A304104, a filter sequence related to how the divisors of n are expressed in Fibonacci number system.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 5, 6, 7, 4, 5, 8, 2, 9, 4, 10, 11, 12, 11, 8, 6, 9, 13, 14, 15, 4, 16, 17, 5, 18, 11, 8, 19, 20, 9, 21, 13, 22, 4, 23, 11, 24, 25, 26, 27, 28, 5, 29, 30, 31, 32, 8, 33, 34, 6, 35, 36, 9, 11, 37, 25, 22, 12, 38, 39, 40, 33, 41, 16, 42, 25, 43, 11, 44, 45, 46, 47, 18, 11, 48, 49, 50, 51, 52, 53, 54, 19, 55, 2, 56, 9, 57, 22, 9, 58, 59, 13, 60

Offset: 1

Antti Karttunen, May 13 2018

nonn

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A005086, A304096, A300837, A304101, A304103, A304104.

\\ Needs also code from A304101:
up_to = 65537;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }
A304104(n) = { my(m=1); fordiv(n,d,if(d>1, m *= prime(A304101(d)-1))); (m); };
write_to_bfile(1,rgs_transform(vector(up_to,n,A304104(n))),"b304105.txt");

For all i, j: a(i) = a(j) => b(i) = b(j), where b can be any of {A000005, A005086, A304096 or A300837} for example.

A304096 Number of Lucas numbers larger than 3 (4, 7, 11, 18, ...) that divide n.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 2, 1, 0, 0, 1, 1, 0, 1, 2, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 2, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0, 2, 0, 0, 1, 2, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 2, 0, 1, 0, 2, 0, 0, 0, 2, 0, 0, 1, 1

Offset: 1

Antti Karttunen, May 13 2018

nonn

a(n) is the number of the divisors d of n that are of the form d = A000045(k-1) + A000045(k+1), for k >= 3.

			The divisors of 4 are 1, 2 and 4. Of these only 4 is a Lucas number larger than 3, thus a(4) = 1.
The divisors of 28 are 1, 2, 4, 7, 14 and 28. Of these 4 and 7 are Lucas numbers (A000032) larger than 3, thus a(28) = 2.

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A000032, A000045, A000204, A093540, A102460, A304092, A304094, A304095, A304104.

Cf. also A005086, A300837.

A102460(n) = { my(u1=1,u2=3,old_u1); if(n<=2,sign(n),while(n>u2,old_u1=u1;u1=u2;u2=old_u1+u2);(u2==n)); };
A304096(n) = sumdiv(n,d,(d>3)*A102460(d));

a(n) = Sum_{d|n, d>3} A102460(d).
a(n) = A304094(n) - A079978(n) - 1.
a(n) = A304092(n) - A059841(n) - A079978(n) - 1.
a(n) = A007949(A304104(n)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = A093540 - 4/3 = 0.629524... . - Amiram Eldar, Dec 31 2023

A304094 Number of Lucas numbers (A000204: 1, 3, 4, 7, 11, ... excluding 2) that divide n.

Original entry on oeis.org

1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 3, 1, 2, 2, 2, 1, 3, 1, 2, 3, 2, 1, 3, 1, 1, 2, 3, 2, 2, 1, 2, 3, 1, 2, 4, 1, 1, 2, 2, 1, 3, 1, 3, 2, 1, 2, 3, 2, 1, 2, 2, 1, 3, 2, 3, 2, 2, 1, 3, 1, 1, 3, 2, 1, 3, 1, 2, 2, 2, 1, 4, 1, 1, 2, 3, 3, 2, 1, 2, 2, 1, 1, 4, 1, 1, 3, 3, 1, 3, 2, 2, 2, 2, 1, 3, 1, 2, 3, 2, 1, 2, 1, 2, 3

Offset: 1

Antti Karttunen, May 13 2018

nonn

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A000204, A093540, A304092, A304093, A304096.

Cf. also A005086, A300837.

isA000204(n) = { my(u1=1,u2=3,old_u1); if(n<=2,(n%2),while(n>u2,old_u1=u1;u1=u2;u2=old_u1+u2);(u2==n)); };
A304094(n) = sumdiv(n,d,isA000204(d));

a(n) = A304092(n) - A059841(n).
a(n) = A304096(n) + A079978(n) + 1.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = A093540 = 1.962858... . - Amiram Eldar, Dec 31 2023

A324905 a(n) = A007895(A003965(n)).

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 3, 1, 2, 2, 2, 1, 2, 1, 3, 2, 2, 1, 2, 3, 2, 3, 3, 1, 3, 1, 3, 2, 2, 3, 2, 1, 2, 2, 3, 1, 3, 1, 3, 3, 2, 1, 3, 3, 3, 2, 3, 1, 4, 3, 3, 2, 2, 1, 2, 1, 2, 4, 3, 3, 3, 1, 3, 2, 4, 1, 4, 1, 2, 4, 3, 3, 3, 1, 4, 3, 2, 1, 3, 3, 2, 2, 3, 1, 2, 3, 3, 2, 2, 3, 3, 1, 3, 4, 3, 1, 3, 1, 3, 4

Offset: 1

Antti Karttunen, Apr 14 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 1..17711
Index entries for sequences computed from indices in prime factorization

Cf. A003965, A007895, A300837, A324888, A324907.

A003965(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = fibonacci(2+primepi(f[i, 1]))); factorback(f); };
A007895(n) = { my(s=0); while(n>0, s++; n -= fibonacci(1+A072649(n))); (s); }
A072649(n) = { my(m); if(n<1, 0, m=0; until(fibonacci(m)>n, m++); m-2); }; \\ From A072649
A324905(n) = A007895(A003965(n));

a(n) = A007895(A003965(n)).

A324907 a(n) = A007895(A113175(n)).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 2, 1, 3, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 1, 4, 3, 2, 1, 1, 1, 3, 1, 2, 1, 1, 2, 1, 1, 3, 1, 3, 2, 1, 1, 2, 3, 1, 2, 1, 1, 3, 1, 4, 2, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 1, 3, 4, 1, 2, 1, 3, 1, 1, 4, 3, 3, 1, 2, 1, 1, 4

Offset: 1

Antti Karttunen, Apr 14 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 1..17711

Cf. A113175, A007895, A300837, A324888, A324905.

A113175(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = fibonacci(f[i, 1])); factorback(f); };
A007895(n) = { my(s=0); while(n>0, s++; n -= fibonacci(1+A072649(n))); (s); }
A072649(n) = { my(m); if(n<1, 0, m=0; until(fibonacci(m)>n, m++); m-2); }; \\ From A072649
A324907(n) = A007895(A113175(n));

a(n) = A007895(A113175(n)).

a(2n) = a(n).

A333618 a(n) is the total number of terms (1-digits) in the dual Zeckendorf representation of all divisors of n.

Original entry on oeis.org

1, 2, 3, 4, 3, 7, 3, 7, 6, 7, 5, 12, 4, 8, 8, 11, 5, 14, 6, 12, 9, 10, 5, 20, 7, 9, 11, 14, 6, 20, 6, 17, 11, 10, 10, 23, 6, 12, 11, 21, 5, 22, 6, 17, 17, 11, 6, 30, 8, 17, 13, 17, 8, 23, 12, 22, 13, 13, 6, 33, 7, 12, 18, 23, 12, 26, 6, 17, 13, 23, 7, 37, 7, 14

Offset: 1

Amiram Eldar, Mar 29 2020

			For n = 6, its divisors are 1, 2, 3 and 6. The dual Zeckendorf representations (A104326) of the divisors are 1, 10, 11 and 111. Their total number of 1's is 1 + 1 + 2 + 3 = 7, thus a(6) = 7.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A034690, A093653, A104326, A112310, A300837.

fibTerms[n_] := Module[{k = Ceiling[Log[GoldenRatio, n*Sqrt[5]]], t = n, fr = {}}, While[k > 1, If[t >= Fibonacci[k], AppendTo[fr, 1]; t = t - Fibonacci[k], AppendTo[fr, 0]]; k--]; fr];
dualZeckSum[n_] := Module[{v = fibTerms[n]}, nv = Length[v]; i = 1; While[i <= nv - 2, If[v[[i]] == 1 && v[[i + 1]] == 0 && v[[i + 2]] == 0, v[[i]] = 0; v[[i + 1]] = 1; v[[i + 2]] = 1; If[i > 2, i -= 3]]; i++]; i = Position[v, _?(# > 0 &)]; If[i == {}, 0, Total[v[[i[[1, 1]] ;; -1]]]]];
a[n_] := DivisorSum[n, dualZeckSum[#] &]; Array[a, 100]

a(n) = Sum_{d|n} A112310(d).

cp's OEIS Frontend

A333619 Numbers that are divisible by the total number of 1's in the Zeckendorf representations of all their divisors (A300837).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A333621 Numbers that are divisible by the total number of 1's in both the Zeckendorf and the dual Zeckendorf representations of all their divisors (A300837 and A333618).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A304092 Number of Lucas numbers (A000032: 2, 1, 3, 4, 7, 11, ...) dividing n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A300836 a(n) is the total number of terms (1-digits) in Zeckendorf representation of all proper divisors of n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

Formula

A304105 Restricted growth sequence transform of A304104, a filter sequence related to how the divisors of n are expressed in Fibonacci number system.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A304096 Number of Lucas numbers larger than 3 (4, 7, 11, 18, ...) that divide n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A304094 Number of Lucas numbers (A000204: 1, 3, 4, 7, 11, ... excluding 2) that divide n.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A324905 a(n) = A007895(A003965(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A324907 a(n) = A007895(A113175(n)).

Views

Author

Keywords