39283

Appears in sequences

• Smallest number that requires n iterations of the unitary totient function (A047994) to reach 1.at n=25A003271
• a(n) = floor(Fibonacci(n)/5).at n=27A004698
• a(n) = floor( n*(n-1)*(n-2)*(n-3)/25 ).at n=33A011935
• Counterbalanced numbers: Composite numbers k such that phi(k)/(sigma(k)-k) is an integer.at n=29A055940
• Composite numbers not divisible by 2 or 3 which in base 3 contain their largest proper factor as a substring.at n=35A063132
• a(n) = floor(L^3*{phi^(3*n-2), phi^(3*n-1), phi^(3*n-2) + phi^(3*n-1)}) where L = (1 + sqrt(5))/(2*sqrt(5)) and phi = (1 + sqrt(5))/2.at n=23A115315
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, -1), (1, -1, 0), (1, 1, 0)}.at n=9A149348
• Integers n such that by inserting between their digits + or - or * or / or ^ or nothing (i.e., concatenate two digits) you recover n back in a nontrivial way.at n=24A157198
• n^3+Largest square, (Largest square <= n^3).at n=27A176580
• Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 1,0 1,1 0,-1 or -1,1.at n=10A264564
• a(n) = a(n-1) + 2*a(n-2) + a([n/2]), where a(0) = 1, a(1) = 1, a(2) = 1.at n=16A298415