Sequences
392,541 sequences
- a(n) = 0 if n is divisible by the square of odd prime, a(n) = 1 if n is an odd squarefree number, a(n) = 2 otherwise.A078461
a(n) = 0 if n is divisible by the square of odd prime, a(n) = 1 if n is an odd squarefree number, a(n) = 2 otherwise.
- Partial sums of A035185.A078462
Partial sums of A035185.
- a(n) = A000594(n+1) - A000594(n).A078463
a(n) = A000594(n+1) - A000594(n).
- Erroneous version of A177454.A078464
Erroneous version of A177454.
- Primonacci numbers: a(n)=a(n-2)+a(n-3)+a(n-5)+a(n-7)+a(n-11)+...+a(n-p(k))+... until n <= p(k), where p(k) is the k-th prime. a(1)=a(2)=1.A078465
Primonacci numbers: a(n)=a(n-2)+a(n-3)+a(n-5)+a(n-7)+a(n-11)+...+a(n-p(k))+... until n <= p(k), where p(k) is the k-th prime. a(1)=a(2)=1.
- First cycle is reached under a "Collatz-Fibonacci" transform (cf. comment).A078466
First cycle is reached under a "Collatz-Fibonacci" transform (cf. comment).
- a(n) = a(n-1) + a(n-4); first four terms are 0,1,2,3.A078467
a(n) = a(n-1) + a(n-4); first four terms are 0,1,2,3.
- Distinct compositions of the complete graph on n+2 vertices with one edge removed (K^-_{n+2}).A078468
Distinct compositions of the complete graph on n+2 vertices with one edge removed (K^-_{n+2}).
- Number of different compositions of the ladder graph L_n.A078469
Number of different compositions of the ladder graph L_n.
- Continued fraction for zeta(3/2) (A078434).A078470
Continued fraction for zeta(3/2) (A078434).
- Sum of all odd divisors of all positive integers <= n.A078471
Sum of all odd divisors of all positive integers <= n.
- Partial sums of A035282.A078472
Partial sums of A035282.
- Expansion of zeta function of icosian ring.A078473
Expansion of zeta function of icosian ring.
- a(1)=a(2)=a(3)=1, a(n)=n-a(a(n-1))-a(a(n-2))-a(a(n-3)).A078474
a(1)=a(2)=a(3)=1, a(n)=n-a(a(n-1))-a(a(n-2))-a(a(n-3)).
- Determinant of rank n matrix of 1..n^2 filled successively back and forth along antidiagonals.A078475
Determinant of rank n matrix of 1..n^2 filled successively back and forth along antidiagonals.
- Time taken to get n people from one side of a bridge to the other where (a) the only flashlight must be carried when crossing; (b) only one or two people may cross at the same time; (c) a pair crosses at the speed of the slowest member; and (d) the k-th person's speed requires k seconds to cross the bridge.A078476
Time taken to get n people from one side of a bridge to the other where (a) the only flashlight must be carried when crossing; (b) only one or two people may cross at the same time; (c) a pair crosses at the speed of the slowest member; and (d) the k-th person's speed requires k seconds to cross the bridge.
- Number of rational knots with n crossings and unknotting number = 1 (chiral pairs counted only once).A078477
Number of rational knots with n crossings and unknotting number = 1 (chiral pairs counted only once).
- Number of rational knots of n crossings with signature 0 (chiral pairs counted twice).A078478
Number of rational knots of n crossings with signature 0 (chiral pairs counted twice).
- a(1)=1, a(n+1)=a(spf(n))+a(gpf(n)), where spf(n) and gpf(n) are the smallest and greatest prime factors of n (A020639, A006530).A078479
a(1)=1, a(n+1)=a(spf(n))+a(gpf(n)), where spf(n) and gpf(n) are the smallest and greatest prime factors of n (A020639, A006530).
- Number of permutations p of {1,2,...,n} such that |p(i)-i| != 1 for all i.A078480
Number of permutations p of {1,2,...,n} such that |p(i)-i| != 1 for all i.
- Expansion of (1 - x - x^2 - sqrt(1 - 2*x - 5*x^2 - 2*x^3 + x^4)) / (2*x + 2*x^2).A078481
Expansion of (1 - x - x^2 - sqrt(1 - 2*x - 5*x^2 - 2*x^3 + x^4)) / (2*x + 2*x^2).
- Expansion of g.f. (1 - 3*x + x^2 - sqrt(1 - 6*x + 7*x^2 - 2*x^3 + x^4))/(2*x).A078482
Expansion of g.f. (1 - 3*x + x^2 - sqrt(1 - 6*x + 7*x^2 - 2*x^3 + x^4))/(2*x).
- Expansion of g.f. -2*x/(1 - 5*x - sqrt(1-4*x) + x*sqrt(1-4*x) + 2*x^2).A078483
Expansion of g.f. -2*x/(1 - 5*x - sqrt(1-4*x) + x*sqrt(1-4*x) + 2*x^2).
- G.f.: -x*(1-2*x+2*x^2)/(2*x^3-4*x^2+4*x-1).A078484
G.f.: -x*(1-2*x+2*x^2)/(2*x^3-4*x^2+4*x-1).
- Number of irreducible indecomposable permutations of degree n.A078485
Number of irreducible indecomposable permutations of degree n.
- Expansion of (x-7*x^2+19*x^3-21*x^4+10*x^5-6*x^6) / (1-9*x+31*x^2-53*x^3+44*x^4-16*x^5+6*x^6).A078486
Expansion of (x-7*x^2+19*x^3-21*x^4+10*x^5-6*x^6) / (1-9*x+31*x^2-53*x^3+44*x^4-16*x^5+6*x^6).
- G.f.: (1-9*x+29*x^2-30*x^3+10*x^4-x^5-(1-6*x+x^2)^(1/2)*(1-6*x+13*x^2-7*x^3+x^4))/(2*x).A078487
G.f.: (1-9*x+29*x^2-30*x^3+10*x^4-x^5-(1-6*x+x^2)^(1/2)*(1-6*x+13*x^2-7*x^3+x^4))/(2*x).
- First differences of coefficients of g.f. (1-x)^24.A078488
First differences of coefficients of g.f. (1-x)^24.
- a(n)=j such that binomial(n,j)<binomial(n-1,j-2).A078489
a(n)=j such that binomial(n,j)<binomial(n-1,j-2).
- Sorted A079341.A078490
Sorted A079341.
- a(n) = lcm(1..Catalan(n)).A078491
a(n) = lcm(1..Catalan(n)).
- No-prime decades.A078492
No-prime decades.
- One-prime decades.A078493
One-prime decades.
- Primes occurring only once in their decade.A078494
Primes occurring only once in their decade.
- a(n) = (a(n-1) * a(n-6) + a(n-3) * a(n-4)) / a(n-7) (a variant of Somos-7).A078495
a(n) = (a(n-1) * a(n-6) + a(n-3) * a(n-4)) / a(n-7) (a variant of Somos-7).
- Smallest prime p such that p>n and 2*n-p is also prime.A078496
Smallest prime p such that p>n and 2*n-p is also prime.
- The member r of a triple of primes (p,q,r) in arithmetic progression which sum to 3*prime(n) = A001748(n) = p + q + r.A078497
The member r of a triple of primes (p,q,r) in arithmetic progression which sum to 3*prime(n) = A001748(n) = p + q + r.
- Let q(n) be the prime defined in A078497; sequence gives (q(n)-prime(n))/6.A078498
Let q(n) be the prime defined in A078497; sequence gives (q(n)-prime(n))/6.
- Two-prime decades.A078499
Two-prime decades.
- Primes occurring only twice in a decade.A078500
Primes occurring only twice in a decade.
- a(n) = Sum_{k=1..n^2} A078446(k).A078501
a(n) = Sum_{k=1..n^2} A078446(k).
- a(n) = smallest positive integer N such that (N - k)/k is prime for k = 1, 2, ..., n.A078502
a(n) = smallest positive integer N such that (N - k)/k is prime for k = 1, 2, ..., n.
- a(n) = binomial(phi(n+1),phi(n)).A078503
a(n) = binomial(phi(n+1),phi(n)).
- a(n) = binomial(sigma(n+1), sigma(n)).A078504
a(n) = binomial(sigma(n+1), sigma(n)).
- Possible values for smallest pseudoprime ( > n ) to base n.A078505
Possible values for smallest pseudoprime ( > n ) to base n.
- Decimal expansion of sum of inverses of unrestricted partition function.A078506
Decimal expansion of sum of inverses of unrestricted partition function.
- Duplicate of A060199.A078507
Duplicate of A060199.
- Number of primes between sqrt(n^3) and sqrt((n+1)^3).A078508
Number of primes between sqrt(n^3) and sqrt((n+1)^3).
- Number of permutations p of {1,2,...,n} such that p(i)-i != 1 and p(i)-i != 2 for all i.A078509
Number of permutations p of {1,2,...,n} such that p(i)-i != 1 and p(i)-i != 2 for all i.
- Spiro-Fibonacci numbers, a(n) = sum of two previous terms that are nearest when terms arranged in a spiral.A078510
Spiro-Fibonacci numbers, a(n) = sum of two previous terms that are nearest when terms arranged in a spiral.