login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A278236 Filter-sequence for factorial base (digit values): least number with the same prime signature as A276076(n). 13
1, 2, 2, 6, 4, 12, 2, 6, 6, 30, 12, 60, 4, 12, 12, 60, 36, 180, 8, 24, 24, 120, 72, 360, 2, 6, 6, 30, 12, 60, 6, 30, 30, 210, 60, 420, 12, 60, 60, 420, 180, 1260, 24, 120, 120, 840, 360, 2520, 4, 12, 12, 60, 36, 180, 12, 60, 60, 420, 180, 1260, 36, 180, 180, 1260, 900, 6300, 72, 360, 360, 2520, 1800, 12600, 8, 24, 24, 120, 72, 360, 24, 120, 120, 840, 360, 2520 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

This sequence can be used for filtering certain factorial base related sequences, because it matches only with any such sequence b that can be computed as b(n) = f(A276076(n)), where f(n) is any function that depends only on the prime signature of n (some of these are listed under the index entry for "sequences computed from exponents in ...").

Matching in this context means that the sequence a matches with the sequence b iff for all i, j: a(i) = a(j) => b(i) = b(j). In other words, iff the sequence b partitions the natural numbers to the same or coarser equivalence classes (as/than the sequence a) by the distinct values it obtains.

Any such sequence should match where the result is computed from the nonzero digits (that may also be > 9) in the factorial base representation of n, but does not depend on their order. Some of these are listed on the last line of the Crossrefs section.

Note that as A275735 is present in that list it means that the sequences matching to its filter-sequence A278235 form a subset of the sequences matching to this sequence. Also, for A275735 there is a stronger condition that for any i, j: a(i) = a(j) <=> A275735(i) = A275735(j), which if true, would imply that there is an injective function f such that f(A275735(n)) = A278236(n), and indeed, this function seems to be A181821.

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..40320

Index entries for sequences computed from exponents in factorization of n

Index entries for sequences related to factorial base representation

FORMULA

a(n) = A046523(A276076(n)).

a(n) = A181821(A275735(n)). [Empirical formula found with the help of equivalence class matching. Not yet proved.]

PROG

(Scheme) (define (A278236 n) (A046523 (A276076 n)))

CROSSREFS

Cf. A007623, A046523, A181821, A276076.

Similar sequences: A278222 (base-2 related), A069877 (base-10), A278226 (primorial base), A278225, A278234, A278235 (other variants for factorial base),

Differs from A278226 for the first time at n=24, where a(24)=2, while A278226(24)=16.

Sequences that partition N into same or coarser equivalence classes: A275735 (<=>), A034968, A060130, A227153, A227154, A246359, A257079, A257511, A257679, A257694, A257695, A257696, A264990, A275729, A275806, A275948, A275964, A278235.

Sequence in context: A204904 A109043 A054585 * A278226 A190940 A046203

Adjacent sequences:  A278233 A278234 A278235 * A278237 A278238 A278239

KEYWORD

nonn,base

AUTHOR

Antti Karttunen, Nov 16 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 16:17 EDT 2019. Contains 328223 sequences. (Running on oeis4.)