25282

Appears in sequences

• G.f. satisfies A(x) = 1 + x*cycle_index(G,A(x)) where G = cyclic group of order 31 generated by (1,2,...,31).at n=6A036735
• Number of permutations of 0..(n-1) representable as 1,3,3,1-weighted consecutive sums of 4 adjacent elements of a sequence of n+3 nonnegative integers.at n=15A180214
• Sum of squares of cycle lengths for different cycles in Fibonacci-like sequences modulo n.at n=37A233246
• Values of n such that A080221(n)=6; i.e., values of n such that n is divisible by the sum of digits of n when expressed in exactly 6 of the bases b=1...n.at n=25A271311
• a(n) = Fibonacci(n) represented in bijective base-8 numeration.at n=20A282239
• a(n) = 2*a(n-1) - a(n-4), where a(0) = 2, a(1) = 4, a(2) = 6, a(3) = 10.at n=16A288465
• Numbers k such that 24*k-1 has at least three factors 7 and the partition function evaluated at k has at least the same number of factors 7 as 24*k-1.at n=31A340957
• Number of positive integers with n digits in which adjacent digits differ by at most 4.at n=4A383199