Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
For questions about sequences of integers. References are often made to the online resource oeis.org.
10
votes
2
answers
1k
views
Consecutive numbers with mutually distinct exponents in their canonical prime factorization
Is it possible to find 23 consecutive positive integers each of which has mutually distinct exponents in its canonical prime factorization? Such numbers are sequence A130091 in OEIS. 24 such numbers a …
6
votes
1
answer
240
views
On the growth and bounds for a certain sequence of integers known as Bogotá numbers
A Bogotá number is a non-negative integer equal to some smaller number, or itself, times its digital product, i.e. the product of its digits. For example, 138 is a Bogotá number because 138 = 23 x (2 …
6
votes
1
answer
438
views
The largest digital sum of the square of an n-digit number
The sequence $13, 31, 46, 63, 81, 97, 112, 130, 148, 162, 180, \dots,$ (sequence A348300 in the OEIS) shows the largest digital sum the square of an $n$-digit (decimal) number has.
Is this sequence st …
3
votes
1
answer
240
views
A special type of Langford pairing
A Langford pairing is a permutation of the sequence of 2n numbers 1, 1, 2, 2, ..., n, n in which the two 1s are one unit apart, the two 2s are two units apart, and more generally the two copies of eac …
3
votes
0
answers
195
views
Is this sequence always periodical?
Is the following sequence always periodical?