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

A093141 Expansion of (1-6*x)/(1-10*x).

Original entry on oeis.org

1, 4, 40, 400, 4000, 40000, 400000, 4000000, 40000000, 400000000, 4000000000, 40000000000, 400000000000, 4000000000000, 40000000000000, 400000000000000, 4000000000000000, 40000000000000000, 400000000000000000, 4000000000000000000, 40000000000000000000, 400000000000000000000
Offset: 0

Views

Author

Paul Barry, Mar 24 2004

Keywords

Comments

Partial sums are A093140. A convex combination of 10^n and 0^n.

Crossrefs

Cf. A093140.

Programs

Formula

a(n) = 4*10^n/10 + 6*0^n/10.
a(n) = phi(10^n). - Paul Barry, Jul 02 2007
a(n) = 4*10^(n-1), n > 0. - Vincenzo Librandi, Aug 02 2010
From Elmo R. Oliveira, Aug 21 2024: (Start)
E.g.f.: (2*exp(10*x) + 3)/5.
a(n) = 10*a(n-1) for n > 1. (End)

Extensions

a(19)-a(21) from Elmo R. Oliveira, Aug 21 2024

A362792 Numbers k such that 3*k and 7*k share the same set of digits.

Original entry on oeis.org

0, 45, 75, 423, 445, 450, 513, 750, 891, 1089, 1305, 2382, 2497, 4230, 4445, 4450, 4488, 4491, 4500, 4505, 4513, 4878, 5013, 5045, 5130, 5133, 5868, 7317, 7500, 7686, 8360, 8703, 8891, 8901, 8910, 8911, 8955, 8991, 9756, 9891, 10089, 10449, 10889, 10890, 10891
Offset: 1

Views

Author

Alexandru Petrescu, May 04 2023

Keywords

Comments

The sequence is infinite because if k is a term, then 10*k is also a term.
Every number k of the form 44...45 (one of more 4's followed by 5, cf. A093140) is a term because 3*k = 133...35 and 7*k = 311...15.

Examples

			k = 75 is a term because 3*k = 225 and 7*k = 525 share the same set of digits, namely {2,5}.
k = 423 is a term because 3*k = 1269 and 7*k = 2961 share the same set of digits, namely {1,2,6,9}.
		

Crossrefs

Programs

  • Mathematica
    Select[Range[0, 11000], Union[IntegerDigits[3*#]] == Union[IntegerDigits[7*#]] &] (* Amiram Eldar, May 18 2023 *)
  • PARI
    isok(k) = Set(digits(3*k)) == Set(digits(7*k));
    
  • Python
    def ok(n): return set(str(3*n)) == set(str(7*n))
    print([k for k in range(11000) if ok(k)]) # Michael S. Branicky, May 04 2023
Showing 1-2 of 2 results.