Sequences
392,541 sequences
- A088555 indexed by A000040.A088561
A088555 indexed by A000040.
- Palindromic primes using at most two distinct digits.A088562
Palindromic primes using at most two distinct digits.
- Primes p such that the p-th digit in the decimal expansion of Pi is 0.A088563
Primes p such that the p-th digit in the decimal expansion of Pi is 0.
- a(n)=sum(i=0,n,binomial(2*i,i) (mod 3)).A088564
a(n)=sum(i=0,n,binomial(2*i,i) (mod 3)).
- Primes p such that the p-th digit in the decimal expansion of Pi is 1.A088565
Primes p such that the p-th digit in the decimal expansion of Pi is 1.
- Primes p such that the p-th digit in the decimal expansion of Pi is 2.A088566
Primes p such that the p-th digit in the decimal expansion of Pi is 2.
- Number of "non-squashing" partitions of n into distinct parts.A088567
Number of "non-squashing" partitions of n into distinct parts.
- 3*n - 2*(partial sums of Kolakoski sequence A000002).A088568
3*n - 2*(partial sums of Kolakoski sequence A000002).
- Anti-Kolakoski sequence (sequence of run lengths never coincides with the sequence itself).A088569
Anti-Kolakoski sequence (sequence of run lengths never coincides with the sequence itself).
- Sum of terms in n-th block of Kolakoski sequence.A088570
Sum of terms in n-th block of Kolakoski sequence.
- a(n) = A088314(n) - A000009(n).A088571
a(n) = A088314(n) - A000009(n).
- Numbers n such that (2n+1)^2 - 2 is prime.A088572
Numbers n such that (2n+1)^2 - 2 is prime.
- Smallest m such that {n+k*(n-1): 0<k<=m} contains exactly as many primes as <= n.A088573
Smallest m such that {n+k*(n-1): 0<k<=m} contains exactly as many primes as <= n.
- Representative lunar primes.A088574
Representative lunar primes.
- Bisection of A088567.A088575
Bisection of A088567.
- Position of the first location of n in the decimal expansion of e.A088576
Position of the first location of n in the decimal expansion of e.
- Position of the first location of n in the digits of phi = 1.61803398874989....A088577
Position of the first location of n in the digits of phi = 1.61803398874989....
- a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=2.A088578
a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=2.
- Primes of the form n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=2.A088579
Primes of the form n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=2.
- a(n) = 1 + sigma(n).A088580
a(n) = 1 + sigma(n).
- a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=3.A088581
a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=3.
- a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=4.A088582
a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=4.
- Primes of the form n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=4.A088583
Primes of the form n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=4.
- Primes of the form n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=3.A088584
Primes of the form n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=3.
- Bisection of A088567.A088585
Bisection of A088567.
- Larger section of edge A089025(n) by integral cevian A088513(n).A088586
Larger section of edge A089025(n) by integral cevian A088513(n).
- Difference between the two segments of edge d = A089025(n) partitioned by cevian c = A088513(n).A088587
Difference between the two segments of edge d = A089025(n) partitioned by cevian c = A088513(n).
- Natural two base element sequence based on Pi and e and a prime sequence.A088588
Natural two base element sequence based on Pi and e and a prime sequence.
- An improved natural sequence based on two base scales Pi and e and the prime sequence.A088589
An improved natural sequence based on two base scales Pi and e and the prime sequence.
- A nonsense sequence.A088590
A nonsense sequence.
- A nonsense sequence.A088591
A nonsense sequence.
- Let p be the n-th 4k+3 prime (A002145), g be any primitive root of p. The mapping x->g^x mod p gives a permutation of {1,2,...,p-1}. a(n) is 0 if the permutation is even for each g, 1 if odd for each g.A088592
Let p be the n-th 4k+3 prime (A002145), g be any primitive root of p. The mapping x->g^x mod p gives a permutation of {1,2,...,p-1}. a(n) is 0 if the permutation is even for each g, 1 if odd for each g.
- a(0)=18; a(n+1) = largest odd factor of 3*a(n)+1; stop when a(n)=1.A088593
a(0)=18; a(n+1) = largest odd factor of 3*a(n)+1; stop when a(n)=1.
- Number of 3-dimensional lattice paths running from (0,0,0) to (n,n,n), lying in {(x,y,z) : 0<=x<=y<=z} and using the steps (1,0,0), (0,1,0), (0,0,1), (1,1,0), (1,0,1), (0,1,1), (1,1,1).A088594
Number of 3-dimensional lattice paths running from (0,0,0) to (n,n,n), lying in {(x,y,z) : 0<=x<=y<=z} and using the steps (1,0,0), (0,1,0), (0,0,1), (1,1,0), (1,0,1), (0,1,1), (1,1,1).
- Numbers n such that (A006530(n) + A020639(n))/2 is an integer, divides n and it is not a power of prime number: it has at least 2 distinct prime factors. Special terms of A088948.A088595
Numbers n such that (A006530(n) + A020639(n))/2 is an integer, divides n and it is not a power of prime number: it has at least 2 distinct prime factors. Special terms of A088948.
- Duplicate of A077293.A088596
Duplicate of A077293.
- First (most significant) number in the concatenation of A077293(n).A088597
First (most significant) number in the concatenation of A077293(n).
- Number of numbers appearing in the concatenation A077293(n).A088598
Number of numbers appearing in the concatenation A077293(n).
- Smallest multiple of n using only one nonzero digit.A088599
Smallest multiple of n using only one nonzero digit.
- Number of simple loops with n elements: loops with no real substructure, every subset which is closed under the operation is either {E} or the whole set.A088600
Number of simple loops with n elements: loops with no real substructure, every subset which is closed under the operation is either {E} or the whole set.
- Number of steps to reach 0 when iterating A261424(x) = x - (the largest palindrome less than x), starting at n.A088601
Number of steps to reach 0 when iterating A261424(x) = x - (the largest palindrome less than x), starting at n.
- Number of primes obtained by prefixing a single (nonzero) digit to 2n-1.A088602
Number of primes obtained by prefixing a single (nonzero) digit to 2n-1.
- a(n) = smallest prime in which n substrings containing the most significant digit are primes.A088603
a(n) = smallest prime in which n substrings containing the most significant digit are primes.
- a(n) = smallest prime in which n substrings containing the least significant digit are primes.A088604
a(n) = smallest prime in which n substrings containing the least significant digit are primes.
- a(n) is the beginning of the first set of n consecutive primes such that the concatenation of n with each of these primes is also prime.A088605
a(n) is the beginning of the first set of n consecutive primes such that the concatenation of n with each of these primes is also prime.
- Smallest number k such that concatenation of k and prime(n) is a prime, or 0 if no other number exists. a(1) = a(3) = 0.A088606
Smallest number k such that concatenation of k and prime(n) is a prime, or 0 if no other number exists. a(1) = a(3) = 0.
- a(1) = 1. For n > 1, a(n) = prime(n) if n is prime, else a(n) = composite(n).A088607
a(1) = 1. For n > 1, a(n) = prime(n) if n is prime, else a(n) = composite(n).
- a(1) = 1, a(n) = prime(n) if n is composite else a(n) = composite(n).A088608
a(1) = 1, a(n) = prime(n) if n is composite else a(n) = composite(n).
- a(1) = 1, a(n) is the smallest squarefree number not included earlier if n is not squarefree, else n is the smallest nonsquarefree number.A088609
a(1) = 1, a(n) is the smallest squarefree number not included earlier if n is not squarefree, else n is the smallest nonsquarefree number.
- Starting with n = 1, a(n) is the smallest squarefree number not included earlier if n is odd, else n is the smallest nonsquarefree number.A088610
Starting with n = 1, a(n) is the smallest squarefree number not included earlier if n is odd, else n is the smallest nonsquarefree number.