This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A322490 #41 Feb 27 2023 04:02:43 %S A322490 3,17,23,37,43,57,63,77,83,97,103,117,123,137,143,157,163,177,183,197, %T A322490 203,217,223,237,243,257,263,277,283,297,303,317,323,337,343,357,363, %U A322490 377,383,397,403,417,423,437,443,457,463,477,483,497,503,517,523,537,543,557,563 %N A322490 Numbers k such that k^k ends with 7. %C A322490 Equivalently, numbers k such that k and (7^h)^k end with the same digit, where h == 1 (mod 4). %C A322490 Also, numbers k such that k and (3^h)^k end with the same digit, where h == 3 (mod 4). %C A322490 Numbers congruent to {3, 17} mod 20. - _Amiram Eldar_, Feb 27 2023 %H A322490 Colin Barker, <a href="/A322490/b322490.txt">Table of n, a(n) for n = 1..1000</a> %H A322490 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1). %F A322490 O.g.f.: x*(3 + 14*x + 3*x^2)/((1 + x)*(1 - x)^2). %F A322490 E.g.f.: 3 + 2*exp(-x) + 5*(2*x - 1)*exp(x). %F A322490 a(n) = -a(-n+1) = a(n-1) + a(n-2) - a(n-3). %F A322490 a(n) = 10*n + 2*(-1)^n - 5. Therefore: %F A322490 a(n) = 10*n - 7 for odd n; %F A322490 a(n) = 10*n - 3 for even n. %F A322490 a(n+2*k) = a(n) + 20*k. %F A322490 Sum_{n>=1} (-1)^(n+1)/a(n) = tan(7*Pi/20)*Pi/20. - _Amiram Eldar_, Feb 27 2023 %p A322490 select(n->n^n mod 10=7,[$1..563]); # _Paolo P. Lava_, Dec 18 2018 %t A322490 Table[10 n + 2 (-1)^n - 5, {n, 1, 60}] %t A322490 LinearRecurrence[{1,1,-1},{3,17,23},80] (* _Harvey P. Dale_, Sep 15 2019 *) %o A322490 (Sage) [10*n+2*(-1)^n-5 for n in (1..70)] %o A322490 (Maxima) makelist(10*n+2*(-1)^n-5, n, 1, 70); %o A322490 (GAP) List([1..70], n -> 10*n+2*(-1)^n-5); %o A322490 (Magma) [10*n+2*(-1)^n-5: n in [1..70]]; %o A322490 (Python) [10*n+2*(-1)**n-5 for n in range(1, 70)] %o A322490 (Julia) [10*n+2*(-1)^n-5 for n in 1:70] |> println %o A322490 (PARI) apply(A322490(n)=10*n+2*(-1)^n-5, [1..70]) %o A322490 (PARI) Vec(x*(3 + 14*x + 3*x^2) / ((1 + x)*(1 - x)^2) + O(x^55)) \\ _Colin Barker_, Dec 13 2018 %Y A322490 Cf. A004526, A056849. %Y A322490 Subsequence of A063226, A295009. %Y A322490 Similar sequences are listed in A322489. %K A322490 nonn,base,easy %O A322490 1,1 %A A322490 _Bruno Berselli_, Dec 12 2018