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 11-16 of 16 results.

A342727 Digitally balanced numbers in base i-1: numbers that in base i-1 have the same number of 0's as 1's.

Original entry on oeis.org

2, 21, 26, 31, 36, 41, 46, 51, 310, 315, 325, 330, 335, 340, 345, 350, 355, 360, 365, 370, 375, 390, 395, 405, 410, 415, 420, 425, 430, 435, 455, 470, 475, 485, 490, 495, 535, 550, 555, 565, 570, 575, 580, 585, 590, 595, 600, 605, 610, 620, 625, 630, 635, 645
Offset: 1

Views

Author

Amiram Eldar, Mar 19 2021

Keywords

Examples

			2 is a term since its representation in base i-1, 1100, has 2 0's and 2 1's.
21 is a term since its representation in base i-1, 110011010001, has 6 0's and 6 1's.

Links

Crossrefs

Cf. A066321, A066323, A271472, A342725, A342726, A342728, A342729.
Similar sequences: A031443 (binary), A210619 (Zeckendorf).

Programs

  • Mathematica
    v = {{0, 0, 0, 0}, {0, 0, 0, 1}, {1, 1, 0, 0}, {1, 1, 0, 1}}; balQ[n_] := Plus @@ (d = IntegerDigits[n]) == Length[d]/2; q[n_] := balQ @ FromDigits[Flatten@v[[1 + Reverse @ Most[Mod[NestWhileList[(# - Mod[#, 4])/-4 &, n, # != 0 &], 4]]]]]; Select[Range[1000], q]

A342728 a(n) is the least number k such that A066323(k) = n.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 23, 39, 55, 71, 87, 103, 359, 615, 871, 1127, 1383, 1639, 5735, 9831, 13927, 18023, 22119, 26215, 91751, 157287, 222823, 288359, 353895, 419431, 1468007, 2516583, 3565159, 4613735, 5662311, 6710887, 23488103, 40265319, 57042535, 73819751
Offset: 0

Views

Author

Amiram Eldar, Mar 19 2021

Keywords

Comments

a(n) is the least number k whose sum of digits in base i-1 (or in base -4) is n.

Links

Crossrefs

Cf. A007608, A066321, A066323, A271472, A342725, A342726, A342727, A342729.

Programs

  • Mathematica
    Join[{0}, LinearRecurrence[{1,0,0,0,0,16,-16}, Range[7], 50]]

Formula

a(n) = n for n <= 7, and a(n) = a(n-1) + 16*a(n-6) - 16*a(n-7) for n > 7.
G.f.: x*(1 + x + x^2 + x^3 + x^4 + x^5 - 15*x^6)/(1 - x - 16*x^6 + 16*x^7). - Stefano Spezia, Mar 20 2021
From Greg Dresden, Jun 21 2021: (Start)
a(3*n+1) = (24 + (4^n)*(25 - 9*(-1)^n))/40.
a(3*n+2) = (24 + (4^n)*(50 + 6*(-1)^n))/40.
a(3*n+3) = (24 + (4^n)*(75 + 21*(-1)^n))/40. (End)

A364379 Greedy Jacobsthal-Niven numbers: numbers that are divisible by the sum of the digits in their representation in Jacobsthal greedy base (A265747).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 20, 21, 22, 24, 26, 27, 28, 32, 33, 36, 40, 42, 43, 44, 45, 46, 48, 51, 52, 54, 56, 57, 60, 64, 68, 69, 72, 75, 76, 80, 84, 85, 86, 87, 88, 90, 92, 93, 96, 99, 100, 104, 105, 106, 108, 111, 112, 115, 116, 117, 120
Offset: 1

Views

Author

Amiram Eldar, Jul 21 2023

Keywords

Comments

Numbers k such that A265745(k) | k.
The positive Jacobsthal numbers, A001045(n) for n >= 1, are terms since their representation in Jacobsthal greedy base is one 1 followed by n-1 0's, so A265745(A001045(n)) = 1 divides A001045(n).

Links

Crossrefs

Cf. A265745, A265747.
Subsequences: A364380, A364381, A364382, A364383.
Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089, A352107, A352320, A352342, A352508, A364216.

Programs

  • Mathematica
    greedyJacobNivenQ[n_] := Divisible[n, A265745[n]]; Select[Range[120], greedyJacobNivenQ] (* using A265745[n] *)
  • PARI
    isA364379(n) = !(n % A265745(n)); \\ using A265745(n)

A342725 Numbers that are palindromic in base i-1.

Original entry on oeis.org

0, 1, 13, 17, 189, 205, 257, 273, 3005, 3069, 3277, 3341, 4033, 4097, 4305, 4369, 48061, 48317, 49149, 49405, 52173, 52429, 53261, 53517, 64449, 64705, 65537, 65793, 68561, 68817, 69649, 69905, 768957, 769981, 773309, 774333, 785405, 786429, 789757, 790781, 834509
Offset: 1

Views

Author

Amiram Eldar, Mar 19 2021

Keywords

Links

Crossrefs

Cf. A066321, A066323, A271472, A342726, A342727, A342728, A342729.
Similar sequences: A002113 (decimal), A006995 (binary), A014190 (base 3), A014192 (base 4), A029952 (base 5), A029953 (base 6), A029954 (base 7), A029803 (base 8), A029955 (base 9), A046807 (factorial base), A094202 (Zeckendorf), A331191 (dual Zeckendorf), A331891 (negabinary), A333423 (primorial base).

Programs

  • Mathematica
    v = {{0, 0, 0, 0}, {0, 0, 0, 1}, {1, 1, 0, 0}, {1, 1, 0, 1}}; q[n_] := PalindromeQ @ FromDigits[Flatten @ v[[1 + Reverse @ Most[Mod[NestWhileList[(# - Mod[#, 4])/-4 &, n, # != 0 &], 4]]]]]; Select[Range[0, 10^4], q]

Formula

13 is a term since its base-(i-1) presentation is 100010001 which is palindromic.

A364006 Wythoff-Niven numbers: numbers that are divisible by the number of 1's in their Wythoff representation.

Original entry on oeis.org

1, 3, 4, 6, 7, 8, 10, 12, 15, 18, 20, 21, 24, 26, 28, 32, 35, 39, 40, 42, 45, 47, 51, 52, 54, 55, 56, 60, 68, 72, 76, 80, 84, 86, 88, 90, 91, 98, 100, 102, 105, 117, 120, 123, 125, 135, 136, 138, 141, 143, 144, 156, 164, 168, 172, 174, 176, 178, 180, 188, 192
Offset: 1

Views

Author

Amiram Eldar, Jul 01 2023

Keywords

Comments

Numbers k such that A135818(k) | k.
Includes all the positive even-indexed Fibonacci numbers (A001906), since the Wythoff representation of Fibonacci(2*n), for n >= 1, is 1 followed by n-1 0's.

Links

Crossrefs

Cf. A135818, A189921.
Subsequences: A364007, A364008, A364009.
Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089, A352107, A352320, A352508.

Programs

  • Mathematica
    wnQ[n_] := (s = Total[w[n]]) > 0 && Divisible[n, s] (* using the function w[n] from A364005 *)

A364123 Stolarsky-Niven numbers: numbers that are divisible by the number of 1's in their Stolarsky representation (A364121).

Original entry on oeis.org

2, 4, 6, 8, 9, 12, 14, 16, 20, 22, 24, 27, 30, 36, 38, 40, 42, 44, 48, 54, 56, 57, 60, 65, 69, 72, 75, 80, 84, 85, 90, 92, 96, 98, 100, 102, 104, 108, 112, 116, 120, 124, 126, 132, 136, 138, 145, 147, 150, 153, 155, 159, 160, 175, 180, 185, 190, 195, 196, 205
Offset: 1

Views

Author

Amiram Eldar, Jul 07 2023

Keywords

Comments

Numbers k such that A200649(k) | k.
Fibonacci(k) + 1 is a term if k !== 3 (mod 6) (i.e., k is in A047263).

Examples

			4 is a term since its Stolarsky representation, A364121(4) = 10, has one 1 and 4 is divisible by 1.
6 is a term since its Stolarsky representation, A364121(6) = 101, has 2 1's and 6 is divisible by 2.

Links

Crossrefs

Cf. A047263, A200649, A364121.
Subsequences: A364124, A364125, A364126.
Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089, A352107, A352320, A352342, A352508.

Programs

  • Mathematica
    stol[n_] := stol[n] = If[n == 1, {}, If[n != Round[Round[n/GoldenRatio]*GoldenRatio], Join[stol[Floor[n/GoldenRatio^2] + 1], {0}], Join[stol[Round[n/GoldenRatio]], {1}]]];
stolNivQ[n_] := n > 1 && Divisible[n, Total[stol[n]]];
Select[Range[200], stolNivQ]
  • PARI
    stol(n) = {my(phi=quadgen(5)); if(n==1, [], if(n != round(round(n/phi)*phi), concat(stol(floor(n/phi^2) + 1), [0]), concat(stol(round(n/phi)), [1])));}
isA364123(n) = n > 1 && !(n % vecsum(stol(n)));
Previous Showing 11-16 of 16 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.