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

A352342 Lazy-Pell-Niven numbers: numbers that are divisible by the sum of the digits in their maximal (or lazy) representation in terms of the Pell numbers (A352339).

Original entry on oeis.org

1, 2, 4, 9, 12, 15, 20, 24, 25, 28, 30, 35, 40, 48, 50, 54, 56, 60, 63, 64, 70, 72, 78, 84, 88, 91, 96, 102, 115, 120, 136, 144, 160, 162, 168, 180, 182, 184, 189, 207, 209, 210, 216, 217, 234, 246, 256, 261, 270, 304, 306, 308, 315, 320, 328, 333, 350, 352, 357
Offset: 1

Views

Author

Amiram Eldar, Mar 12 2022

Keywords

Comments

Numbers k such that A352340(k) | k.

Examples

			4 is a term since its maximal Pell representation, A352339(4) = 11, has the sum of digits A352340(4) = 1+1 = 2 and 4 is divisible by 2.

Links

Crossrefs

Cf. A352339, A352340.
Subsequences: A352343, A352344, A352345.
Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089, A352107, A352320.

Programs

  • Mathematica
    pell[1] = 1; pell[2] = 2; pell[n_] := pell[n] = 2*pell[n - 1] + pell[n - 2]; pellp[n_] := Module[{s = {}, m = n, k}, While[m > 0, k = 1; While[pell[k] <= m, k++]; k--; AppendTo[s, k]; m -= pell[k]; k = 1]; IntegerDigits[Total[3^(s - 1)], 3]]; q[n_] := Module[{v = pellp[n]}, nv = Length[v]; i = 1; While[i <= nv - 2, If[v[[i]] > 0 && v[[i + 1]] == 0 && v[[i + 2]] < 2, v[[i ;; i + 2]] += {-1, 2, 1}; If[i > 2, i -= 3]]; i++]; i = Position[v, _?(# > 0 &)]; Divisible[n, Plus @@ v[[i[[1, 1]] ;; -1]]]]; Select[Range[300], q]

A352508 Catalan-Niven numbers: numbers that are divisible by the sum of the digits in their representation in terms of the Catalan numbers (A014418).

Original entry on oeis.org

1, 2, 4, 5, 6, 9, 10, 12, 14, 16, 18, 21, 24, 28, 30, 32, 33, 40, 42, 44, 45, 48, 55, 56, 57, 60, 65, 72, 78, 80, 84, 88, 95, 100, 105, 112, 126, 128, 130, 132, 134, 135, 138, 140, 144, 145, 146, 147, 152, 155, 156, 168, 170, 174, 180, 184, 185, 195, 210, 216
Offset: 1

Views

Author

Amiram Eldar, Mar 19 2022

Keywords

Comments

Numbers k such that A014420(k) | k.
All the Catalan numbers (A000108) are terms.
If k is an odd Catalan number (A038003), then k+1 is a term.

Examples

			4 is a term since its Catalan representation, A014418(4) = 20, has the sum of digits A014420(4) = 2 + 0 = 2 and 4 is divisible by 2.
9 is a term since its Catalan representation, A014418(9) = 120, has the sum of digits A014420(9) = 1 + 2 + 0 = 3 and 9 is divisible by 3.

Links

Crossrefs

Cf. A014418, A014420.
Subsequences: A000108, A038003, A352509, A352510, A352511.
Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089, A352107, A352320, A352342.

Programs

  • Mathematica
    c[n_] := c[n] = CatalanNumber[n]; q[n_] := Module[{s = {}, m = n, i}, While[m > 0, i = 1; While[c[i] <= m, i++]; i--; m -= c[i]; AppendTo[s, i]]; Divisible[n, Plus @@ IntegerDigits[Total[4^(s - 1)], 4]]]; Select[Range[216], q]

A364216 Jacobsthal-Niven numbers: numbers that are divisible by the sum of the digits in their Jacobsthal representation (A280049).

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 9, 11, 12, 14, 15, 16, 20, 22, 24, 27, 28, 32, 33, 36, 40, 42, 43, 44, 45, 46, 48, 51, 52, 54, 56, 57, 60, 68, 72, 75, 76, 84, 86, 87, 88, 92, 93, 95, 96, 99, 100, 104, 105, 108, 112, 115, 117, 120, 125, 126, 128, 129, 132, 135, 136, 138, 140
Offset: 1

Views

Author

Amiram Eldar, Jul 14 2023

Keywords

Comments

Numbers k such that A364215(k) | k.
A007583 is a subsequence since A364215(A007583(n)) = 1 for n >= 0.

Links

Crossrefs

Cf. A280049, A364215.
Subsequences: A007583, A364217, A364218, A364219, A364220, A364221.
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
    seq[kmax_] := Module[{m = 1, s = {}}, Do[If[Divisible[k, DigitCount[m, 2, 1]], AppendTo[s, k]]; While[m++; OddQ[IntegerExponent[m, 2]]], {k, 1, kmax}]; s]; seq[140]
  • PARI
    lista(kmax) = {my(m = 1); for(k = 1, kmax, if( !(k % sumdigits(m, 2)), print1(k,", ")); until(valuation(m, 2)%2 == 0, m++));}

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)

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)));

A356640 a(n) is the least number k such that the least base in which k is a Niven number is n, i.e., A356552(k) = n, or -1 if no such k exists.

Original entry on oeis.org

1, 3, 50, 5, 44, 7, 161, 119, 201, 11, 253, 13, 494, 226, 1444, 17, 799, 19, 437, 1189, 957, 23, 1081, 2263, 755, 767, 927, 29, 932, 31, 1147, 5141, 1191, 1226, 2009, 37, 1517, 1522, 1641, 41, 1927, 43, 2021, 2026, 2164, 47, 2491, 4559, 5001, 2602, 2757, 53, 2972
Offset: 2

Views

Author

Amiram Eldar, Aug 19 2022

Keywords

Examples

			a(3) = 3 since 3 is a Niven number in base 3 and in no other base smaller than 3. 1 and 2 are also Niven numbers in base 3, but they are also Niven numbers in base 2.

Links

Crossrefs

Cf. A005349, A049445, A064150, A064438, A064481, A356552.
Similar sequence: A249634.

Programs

  • Mathematica
    f[n_] := Module[{b = 2}, While[! Divisible[n, Plus @@ IntegerDigits[n, b]], b++]; b]; A356640[len_, nmax_] := Module[{s = Table[0, {len}], c = 0, n = 1, i}, While[c < len && n < nmax, i = f[n] - 1; If[i <= len && s[[i]] == 0, c++; s[[i]] = n]; n++]; s]; A356640[50, 10^4]

Formula

a(p) = p for an odd prime p.

A325309 Square array read by downward antidiagonals: A(n, k) is the k-th Niven number (or Harshad number) in base n.

Original entry on oeis.org

1, 2, 1, 4, 2, 1, 6, 3, 2, 1, 8, 4, 3, 2, 1, 10, 6, 4, 3, 2, 1, 12, 8, 6, 4, 3, 2, 1, 16, 9, 8, 5, 4, 3, 2, 1, 18, 10, 9, 6, 5, 4, 3, 2, 1, 20, 12, 12, 8, 6, 5, 4, 3, 2, 1, 21, 15, 16, 10, 10, 6, 5, 4, 3, 2, 1, 24, 16, 18, 12, 12, 7, 6, 5, 4, 3, 2, 1, 32, 18
Offset: 2

Views

Author

Felix Fröhlich, Sep 06 2019

Keywords

Examples

			The array starts as follows:
1, 2, 4, 6, 8, 10, 12, 16, 18, 20, 21, 24, 32, 34, 36, 40, 42, 48, 55, 60
1, 2, 3, 4, 6,  8,  9, 10, 12, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 32
1, 2, 3, 4, 6,  8,  9, 12, 16, 18, 20, 21, 24, 28, 30, 32, 33, 35, 36, 40
1, 2, 3, 4, 5,  6,  8, 10, 12, 15, 16, 18, 20, 24, 25, 26, 27, 28, 30, 32
1, 2, 3, 4, 5,  6, 10, 12, 15, 18, 20, 24, 25, 30, 36, 40, 42, 44, 45, 48
1, 2, 3, 4, 5,  6,  7,  8,  9, 12, 14, 15, 16, 18, 21, 24, 27, 28, 30, 32
1, 2, 3, 4, 5,  6,  7,  8, 14, 16, 21, 24, 28, 32, 35, 40, 42, 48, 49, 56
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 12, 16, 18, 20, 24, 27, 28, 30, 32, 36
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 12, 18, 20, 21, 24, 27, 30, 36, 40, 42
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 15, 20, 22, 24, 25, 30, 33, 35
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 22, 24, 33, 36, 44, 48, 55, 60
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 18, 24, 26, 27
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 26, 28, 39, 42, 52, 56
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 21, 28, 30, 32
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 30, 32
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 24
1, 2, 3, 4, 5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 34, 36

Links

Crossrefs

Cf. A049445 (row 2), A064150 (row 3), A064438 (row 4), A064481 (row 5), A245802 (row 8), A005349 (row 10).
Cf. A005349.

Programs

  • PARI
    row(n, terms) = my(i=0); for(x=1, oo, if(i >= terms, break); if(x%sumdigits(x, n)==0, print1(x, ", "); i++))
array(rows, cols) = for(x=2, rows+1, row(x, cols); print(""))
array(18, 20) \\ Print initial 18 rows and 20 columns of array
Previous Showing 11-18 of 18 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.