cp's OEIS Frontend

This sequence is different from A061383. Here digits in k must have all the same parity, otherwise the average of at least a pair of digits wouldn't be an integer. Note that for every 2-digit term in A061383 both digits have the same parity. But not every number whose digits have all the same parity (sequence A059708) belongs here.

Primes p such that p - A084558(p) is also a prime.

Inspired by the fact that this sequence has a nonempty intersection with A124598.

Let H be the intersection of this sequence and A124598. With some observed exceptions q = 3, 103, 1013, 1223, 2903, ..., if some p in this sequence is in H then the corresponding q also belongs to H. It is unknown whether H is finite.

Based upon the first terms of this sequence, it looks like those k satisfying the definition given in NAME are the even terms of A084558 repeated in certain weakly increasing sequence.

It is seems that {a(1), a(2), a(3), a(4)} are the only primes of this form.

From M. F. Hasler, Mar 04 2018: (Start)

For p = 2 and p = 3, a(n) (mod p) is 8- resp. 9-periodic.

For primes 5 <= p <= 23, a(n) (mod p) is p(p-1) periodic. I conjecture this to hold for all p >= 5.

It also appears that the last 4 terms of these periods are (1, 1, 0, 0) (mod p), for any p >= 2, i.e., a(n) is divisible by p at least for k*P-2 <= n <= k*P for any k >= 0, where P is the period length p(p-1) (resp. 8 or 9 for p = 2 and 3).

These properties might allow a proof that a(1..4) are the only primes. However, a(12) = 14231491*21776141, so there is little hope of finding a reasonably sized finite covering set.

(End)

The numbers whose binary representation is a palindrome are excluded by definition because 0 is not a power of a positive number.

It might be thought that the first term should be 1 instead of 2, since by prepending its binary representation (itself) with a zero we get 01 with reverse 10 (decimal 2), and their difference in absolute value is abs(1-2)=1, which is itself its 1st power 1^1. However, leading zeros are ignored. Another alternative interpretation is to consider 1 as a palindrome, which also excludes it from this sequence.

This sequence appears to be dense in semiprimes.

All those terms such that 2n*4^n is equal to p + 4n^2 + 1 belong to A247024.

Subsequence of A245014. a(n) represents the identity between (p + 4k^2 + 1) and (2n*4^k) for the least prime p defining A245014(k). Those first k where it occurs are: 1,2,3,5,41,42,62,183,357,407.

Consider the table of Stirling numbers of the second kind (A008277). The second column contains the numbers A000225, or 2^m - 1, and the first subdiagonal contains the triangular numbers. If a number appears in both sequences, we have the equation f(x) = 2^x - x^2 + x - 2 = 0 which has integer roots x = 1, 2, 3. Set g(x) = (x - 1)*(2^x - 1). Then it is found that the sum f(x) + g(x) for some even x defines this sequence and satisfies in common with A245014: Both sequences have three consecutive terms (those first) such that when they are represented in decimal the third term is the concatenation of the two terms preceding it.

Prime or PRP for x = 2, 4, 6, 10, 82, 84, 124, 366, 714, 814, 1584, 8938, 17812, 27054, 35380, 71358. - Jens Kruse Andersen, Sep 10 2014

The complete solution to the remark on Stirling2 numbers in a comment above is given in A076046. See also my Oct 08 2014 remark in the history. - Wolfdieter Lang, Oct 16 2014

Alternative definition: a(n,x)=T(x,1) for a dichromate or Tutte-Whitney polynomial in which the matrix t[i,j] is defined as t[i,j]=Delta(i,j)*((-1)^isprime(i)) and "Delta" is the Kronecker Delta function. - Michel Marcus, Aug 19 2014

If 10 is replaced by 1, then this becomes A097454. If it is replaced by 2, one gets A242002. Choosing powers of the base b=10, as done here, allows one to easily read off the equivalent for any other base b > 4, by simply replacing digits 8,9 with b-2,b-1 (when terms are written in base b). [Comment extended by M. F. Hasler, Aug 20 2014]

There are 2^n ways of taking the partial sum of the first n powers of b=10 if exponent zero is excluded and the signs can be assigned arbitrarily. Conjecture: When expressed in base b, the absolute value for any of these terms only contains digits belonging to {0,1,b-2,b-1}; here {0,1,8,9}.

Cases of enumeration in ascending order for the first m positive integers when one of them, j, is previously excluded (m=1,2,3,..., 1 <= j <= m).

Table of the k initial permutations, one per block, when all the k! permutations in lexicographic ascending order are split uniformly into k blocks. Such table read by rows for k=1,2,3,... .

These permutations might be considered the initial inputs for a parallel/distributed variant of the Narayana Pandita's algorithm. Such variant would deliver to each thread/core/host one or more of the mentioned inputs, then the remaining permutations can be obtained with (k-1)!-1 executions of the classic Narayana Pandita's algorithm for the next permutation in lexical order.

The terms of A237450 give the positions of rows of this table among the rows of A030298. The finite n X n square matrices converge towards the infinite square array A237447. Please see further comments there. - Antti Karttunen, Feb 10 2014

Alternative way to express this is that each row k=1..n of each n X n matrix contains the lexicographically earliest n-letter permutation beginning with number k, or equally, that each of the n X n square matrices contain in their n rows those n-letter permutations of the symmetric group S_n that correspond to the inverses of cycles (1), (1 2), (1 2 3), ..., (1 2 ... n). Please see the Example section. - Antti Karttunen, Feb 12 2014

The primes in A013918 would have associated a(n)=0 if not for the qualifier "positive" in the definition.

The sum of the first n primes appears to be close to a prime. For illustration, the maximum for a(n) among the first 5 million terms is a(808500) = 218.

See A013916 for the above mentioned indices, numbers n such that the sum of the first n primes is prime. - M. F. Hasler, Jan 20 2014