35845
domain: N
Appears in sequences
- Numbers k such that sigma(k) = sigma(k+10).at n=35A015880
- Divide natural numbers in groups with prime(n) elements and add together.at n=18A034956
- Number of 3 X n arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 3 X n array.at n=30A219520
- Number of nX3 0..2 arrays with successive rows and columns fitting to straight lines with nondecreasing slope, with a single point array taken as having zero slope.at n=3A222994
- Number of nX4 0..2 arrays with successive rows and columns fitting to straight lines with nondecreasing slope, with a single point array taken as having zero slope.at n=2A222995
- T(n,k) = Number of n X k 0..2 arrays with successive rows and columns fitting to straight lines with nondecreasing slope, with a single point array taken as having zero slope.at n=17A222996
- T(n,k) = Number of n X k 0..2 arrays with successive rows and columns fitting to straight lines with nondecreasing slope, with a single point array taken as having zero slope.at n=18A222996
- Numbers n such that 36n+11, 36(n+1)+11, 36(n+2)+11 and 36(n+3)+11 are prime.at n=32A255608
- Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k.at n=15A263534
- a(n) = (4*n^3 + 12*n^2 - 4*n + 3)/3.at n=29A322594
- Sum of the eighth largest parts in the partitions of n into 9 parts.at n=52A326466
- Number of (binary) max-heaps on n elements from the set {0,1} containing exactly seven 0's.at n=27A326508
- Numbers k that divide the k-th little Schroeder number.at n=14A372903