A008851 -id:A008851 - cp's OEIS frontend

A191740 Dispersion of A047220, (numbers >1 and congruent to 0 or 1 or 3 mod 5), by antidiagonals.

1, 3, 2, 6, 5, 4, 11, 10, 8, 7, 20, 18, 15, 13, 9, 35, 31, 26, 23, 16, 12, 60, 53, 45, 40, 28, 21, 14, 101, 90, 76, 68, 48, 36, 25, 17, 170, 151, 128, 115, 81, 61, 43, 30, 19, 285, 253, 215, 193, 136, 103, 73, 51, 33, 22, 476, 423, 360, 323, 228, 173, 123

Offset: 1

Clark Kimberling, Jun 14 2011

For a background discussion of dispersions and their fractal sequences, see A191426.  For dispersions of congruence sequences mod 3, mod 4, or mod 5, see A191655, A191663, A191667, A191702.
...
Suppose that {2,3,4,5,6} is partitioned as {x1, x2} and {x3,x4,x5}.  Let S be the increasing sequence of numbers >1 and congruent to x1 or x2 mod 5, and let T be the increasing sequence of numbers >1 and congruent to x3 or x4 or x5 mod 5.  There are 10 sequences in S, each matched by a (nearly) complementary sequence in T.  Each of the 20 sequences generates a dispersion, as listed here:
...
A191722=dispersion of A008851 (0, 1 mod 5 and >1)
A191723=dispersion of A047215 (0, 2 mod 5 and >1)
A191724=dispersion of A047218 (0, 3 mod 5 and >1)
A191725=dispersion of A047208 (0, 4 mod 5 and >1)
A191726=dispersion of A047216 (1, 2 mod 5 and >1)
A191727=dispersion of A047219 (1, 3 mod 5 and >1)
A191728=dispersion of A047209 (1, 4 mod 5 and >1)
A191729=dispersion of A047221 (2, 3 mod 5 and >1)
A191730=dispersion of A047211 (2, 4 mod 5 and >1)
A191731=dispersion of A047204 (3, 4 mod 5 and >1)
...
A191732=dispersion of A047202 (2,3,4 mod 5 and >1)
A191733=dispersion of A047206 (1,3,4 mod 5 and >1)
A191734=dispersion of A032793 (1,2,4 mod 5 and >1)
A191735=dispersion of A047223 (1,2,3 mod 5 and >1)
A191736=dispersion of A047205 (0,3,4 mod 5 and >1)
A191737=dispersion of A047212 (0,2,4 mod 5 and >1)
A191738=dispersion of A047222 (0,2,3 mod 5 and >1)
A191739=dispersion of A008854 (0,1,4 mod 5 and >1)
A191740=dispersion of A047220 (0,1,3 mod 5 and >1)
A191741=dispersion of A047217 (0,1,2 mod 5 and >1)
...
For further information about these 20 dispersions, see A191722.
...
Regarding the dispersions A191722-A191741, there are general formulas for sequences of the type "(a or b mod m)" and "(a or b or c mod m)" used in the relevant Mathematica programs.

			Northwest corner:
1....3....6....11...20
2....5....10...18...31
4....8....15...26...45
7....13...23...40...68
9....16...28...48...81
12...21...36...61...103

Ivan Neretin, Table of n, a(n) for n = 1..5050 (first 100 antidiagonals, flattened)

Cf. A047211, A047220, A191722, A191730, A191426.

(* Program generates the dispersion array t of the increasing sequence f[n] *)
r = 40; r1 = 12;  c = 40; c1 = 12;
a=3; b=5; c2=6; m[n_]:=If[Mod[n,3]==0,1,0];
f[n_]:=a*m[n+2]+b*m[n+1]+c2*m[n]+5*Floor[(n-1)/3]
Table[f[n], {n, 1, 30}]  (* A047220 *)
mex[list_] := NestWhile[#1 + 1 &, 1, Union[list][[#1]] <= #1 &, 1, Length[Union[list]]]
rows = {NestList[f, 1, c]};
Do[rows = Append[rows, NestList[f, mex[Flatten[rows]], r]], {r}];
t[i_, j_] := rows[[i, j]];
TableForm[Table[t[i, j], {i, 1, 10}, {j, 1, 10}]]
  (* A191740 *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191740  *)

A191741 Dispersion of A047217, (numbers >1 and congruent to 0 or 1 or 2 mod 5), by antidiagonals.

Original entry on oeis.org

1, 2, 3, 5, 6, 4, 10, 11, 7, 8, 17, 20, 12, 15, 9, 30, 35, 21, 26, 16, 13, 51, 60, 36, 45, 27, 22, 14, 86, 101, 61, 76, 46, 37, 25, 18, 145, 170, 102, 127, 77, 62, 42, 31, 19, 242, 285, 171, 212, 130, 105, 71, 52, 32, 23, 405, 476, 286, 355, 217, 176, 120

Offset: 1

Clark Kimberling, Jun 14 2011

For a background discussion of dispersions and their fractal sequences, see A191426.  For dispersions of congruence sequences mod 3, mod 4, or mod 5, see A191655, A191663, A191667, A191702.
...
Suppose that {2,3,4,5,6} is partitioned as {x1, x2} and {x3,x4,x5}.  Let S be the increasing sequence of numbers >1 and congruent to x1 or x2 mod 5, and let T be the increasing sequence of numbers >1 and congruent to x3 or x4 or x5 mod 5.  There are 10 sequences in S, each matched by a (nearly) complementary sequence in T.  Each of the 20 sequences generates a dispersion, as listed here:
...
A191722=dispersion of A008851 (0, 1 mod 5 and >1)
A191723=dispersion of A047215 (0, 2 mod 5 and >1)
A191724=dispersion of A047218 (0, 3 mod 5 and >1)
A191725=dispersion of A047208 (0, 4 mod 5 and >1)
A191726=dispersion of A047216 (1, 2 mod 5 and >1)
A191727=dispersion of A047219 (1, 3 mod 5 and >1)
A191728=dispersion of A047209 (1, 4 mod 5 and >1)
A191729=dispersion of A047221 (2, 3 mod 5 and >1)
A191730=dispersion of A047211 (2, 4 mod 5 and >1)
A191731=dispersion of A047204 (3, 4 mod 5 and >1)
...
A191732=dispersion of A047202 (2,3,4 mod 5 and >1)
A191733=dispersion of A047206 (1,3,4 mod 5 and >1)
A191734=dispersion of A032793 (1,2,4 mod 5 and >1)
A191735=dispersion of A047223 (1,2,3 mod 5 and >1)
A191736=dispersion of A047205 (0,3,4 mod 5 and >1)
A191737=dispersion of A047212 (0,2,4 mod 5 and >1)
A191738=dispersion of A047222 (0,2,3 mod 5 and >1)
A191739=dispersion of A008854 (0,1,4 mod 5 and >1)
A191740=dispersion of A047220 (0,1,3 mod 5 and >1)
A191741=dispersion of A047217 (0,1,2 mod 5 and >1)
...
For further information about these 20 dispersions, see A191722.
...
Regarding the dispersions A191722-A191741, there are general formulas for sequences of the type "(a or b mod m)" and "(a or b or c mod m)" used in the relevant Mathematica programs.

			Northwest corner:
1....2....5....10...17
3....6....11...20...35
4....7....12...21...36
8....15...26...45...76
9....16...27...46...77
13...22...37...62...105

Ivan Neretin, Table of n, a(n) for n = 1..5050 (first 100 antidiagonals, flattened)

Cf. A047204, A047217, A191722, A191731, A191426.

(* Program generates the dispersion array t of the increasing sequence f[n] *)
r = 40; r1 = 12;  c = 40; c1 = 12;
a=2; b=5; c2=6; m[n_]:=If[Mod[n,3]==0,1,0];
f[n_]:=a*m[n+2]+b*m[n+1]+c2*m[n]+5*Floor[(n-1)/3]
Table[f[n], {n, 1, 30}]  (* A047217 *)
mex[list_] := NestWhile[#1 + 1 &, 1, Union[list][[#1]] <= #1 &, 1, Length[Union[list]]]
rows = {NestList[f, 1, c]};
Do[rows = Append[rows, NestList[f, mex[Flatten[rows]], r]], {r}];
t[i_, j_] := rows[[i, j]];
TableForm[Table[t[i, j], {i, 1, 10}, {j, 1, 10}]] (* A191741 *)
Flatten[Table[t[k, n - k + 1], {n, 1, c1}, {k, 1, n}]] (* A191741  *)

A046831 Numbers k such that decimal expansion of k^2 contains k as a substring and k does not end in 0.

Original entry on oeis.org

1, 5, 6, 25, 76, 376, 625, 3792, 9376, 14651, 90625, 109376, 495475, 505025, 890625, 971582, 1713526, 2890625, 4115964, 5133355, 6933808, 7109376, 10050125, 12890625, 48588526, 50050025, 66952741, 87109376, 88027284, 88819024

Offset: 1

David W. Wilson

Subsequence of A018834. - Chai Wah Wu, Apr 04 2023

Giovanni Resta, Table of n, a(n) for n = 1..64

Cf. A018834, A003226, A008851.

a046831 n = a046831_list !! (n-1)
a046831_list = filter ((> 0) . (`mod` 10)) a018834_list
-- Reinhard Zumkeller, Jul 27 2011

Reap[For[n = 1, n < 10^8, n++, If[Mod[n, 10] != 0, If[StringPosition[ToString[n^2], ToString[n]] != {}, Print[n]; Sow[n]]]]][[2, 1]] (* Jean-François Alcover, Apr 04 2013 *)

from itertools import count, islice
def A046831_gen(startvalue=0): # generator of terms >= startvalue
    return filter(lambda n:n%10 and str(n) in str(n**2), count(max(startvalue,0)))
A046831_list = list(islice(A046831_gen(),20)) # Chai Wah Wu, Apr 04 2023

A046851 Numbers n such that n^2 can be obtained from n by inserting internal (but not necessarily contiguous) digits.

Original entry on oeis.org

0, 1, 10, 11, 95, 96, 100, 101, 105, 110, 125, 950, 960, 976, 995, 996, 1000, 1001, 1005, 1006, 1010, 1011, 1021, 1025, 1026, 1036, 1046, 1050, 1100, 1101, 1105, 1201, 1205, 1250, 1276, 1305, 1316, 1376, 1405, 9500, 9505, 9511, 9525, 9600, 9605, 9625

Offset: 1

David W. Wilson

Contains A038444.  In particular, the sequence is infinite. - Robert Israel, Oct 20 2016
If n is any positive term, then b_n(k) := n*10^k (k >= 0) is an infinite subsequence. - Rick L. Shepherd, Nov 01 2016
From Robert Israel's comment it follows that the subsequence of terms with no trailing zeros is also infinite (contains A000533). - Rick L. Shepherd, Nov 01 2016

			110^2 = 12100 (insert "2" and "0" into "1_1_0").

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A045953, A008851, A018834, A038444, A086457 (subsequence).

import Data.List (isInfixOf)
a046851 n = a046851_list !! (n-1)
a046851_list = filter chi a008851_list where
   chi n = (x == y && xs `isSub` ys) where
      x:xs = show $ div n 10
      y:ys = show $ div (n^2) 10
   isSub [] ys       = True
   isSub _  []       = False
   isSub us'@(u:us) (v:vs)
         | u == v    = isSub us vs
         | otherwise = isSub us' vs
-- Reinhard Zumkeller, Jul 27 2011

IsSublist:= proc(a, b)
  local i,bp,j;
  bp:= b;
  for i from 1 to nops(a) do
    j:= ListTools:-Search(a[i],bp);
    if j = 0 then return false fi;
    bp:= bp[j+1..-1];
  od;
  true
end proc:
filter:= proc(n) local A,B;
  A:= convert(n,base,10);
  B:= convert(n^2,base,10);
  if not(A[1] = B[1] and A[-1] = B[-1]) then return false fi;
  if nops(A) <= 2 then return true fi;
  IsSublist(A[2..-2],B[2..-2])
end proc:
select(filter, [$0..10^4]); # Robert Israel, Oct 20 2016

id[n_]:=IntegerDigits[n];
insQ[n_]:=First[id[n]]==First[id[n^2]]&&Last[id[n]]==Last[id[n^2]];
sort[n_]:=Flatten/@Table[Position[id[n^2],id[n][[i]]],{i,1,Length[id[n]]}];
takeQ[n_]:=Module[{lst={First[sort[n][[1]]]}},
   Do[
    Do[
     If[Last[lst]Ivan N. Ianakiev, Oct 19 2016 *)

A301567 Expansion of Product_{k>=1} (1 + x^(5k))(1 + x^(5*k-4)).

Original entry on oeis.org

1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 1, 3, 2, 0, 0, 2, 5, 4, 1, 0, 2, 7, 7, 2, 0, 3, 10, 11, 4, 0, 4, 14, 17, 8, 1, 5, 19, 25, 13, 2, 6, 25, 36, 21, 4, 8, 33, 50, 33, 8, 10, 43, 69, 49, 14, 13, 55, 93, 71, 23, 17, 70, 124, 102, 37, 22, 88, 163, 142, 57, 30, 110, 212, 195, 85

Offset: 0

Ilya Gutkovskiy, Mar 23 2018

nonn

Number of partitions of n into distinct parts congruent to 0 or 1 mod 5.

			a(11) = 3 because we have [11], [10, 1] and [6, 5].

Index entries for sequences related to partitions

Cf. A008851, A035367, A036820, A203776, A219607, A280454, A301562, A301563, A301564, A301565, A301568, A301569, A301570.

nmax = 74; CoefficientList[Series[Product[(1 + x^(5 k)) (1 + x^(5 k - 4)), {k, 1, nmax}], {x, 0, nmax}], x]
nmax = 74; CoefficientList[Series[x^4 QPochhammer[-1, x^5] QPochhammer[-x^(-4), x^5]/(2 (1 + x^4)), {x, 0, nmax}], x]
nmax = 74; CoefficientList[Series[Product[(1 + Boole[MemberQ[{0, 1}, Mod[k, 5]]] x^k), {k, 1, nmax}], {x, 0, nmax}], x]

G.f.: Product_{k>=2} (1 + x^A008851(k)).

a(n) ~ exp(Pi*sqrt(2*n/15)) / (2^(29/20) * 15^(1/4) * n^(3/4)). - Vaclav Kotesovec, Mar 24 2018

A086457 Both n and n^2 have the same initial digit and also n and n^2 have the same final digit when expressed in base 10.

Original entry on oeis.org

0, 1, 10, 11, 95, 96, 100, 101, 105, 106, 110, 111, 115, 116, 120, 121, 125, 126, 130, 131, 135, 136, 140, 141, 895, 896, 950, 951, 955, 956, 960, 961, 965, 966, 970, 971, 975, 976, 980, 981, 985, 986, 990, 991, 995, 996, 1000, 1001, 1005, 1006, 1010, 1011

Offset: 1

Jeremy Gardiner, Jul 20 2003

All terms of A045953 appear in this sequence.
Subsequence of A008851; A045953 and A046851 are subsequences. [Reinhard Zumkeller, Jul 27 2011]
Intersection of A008851 and A089951. - Michel Marcus, Mar 19 2015

			a(12) = 115 appears in the sequence because 115*115 = 13225.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A045953, A086458.

left$(str$(n), 1) = left$(str$(n^2), 1) AND right$(str$(n), 1) = right$(str$(n^2), 1)

a086457 n = a086457_list !! (n-1)
a086457_list = filter (\x -> a000030 x == a000030 (x^2) &&
                             a010879 x == a010879 (x^2)) [0..]
-- Reinhard Zumkeller, Jul 27 2011

ldQ[n_]:=Module[{idn=IntegerDigits[n],idn2=IntegerDigits[n^2]}, First[ idn] == First[idn2]&&Last[idn]==Last[idn2]]; Select[Range[ 0,1100], ldQ]  (* Harvey P. Dale, Feb 06 2011 *)

A000030(a(n)) = A000030(a(n)^2) and A010879(a(n)) = A010879(a(n)^2).

Offset corrected by Reinhard Zumkeller, Jul 27 2011

A045953 Numbers m such that m^2 can be obtained from m by inserting an internal block of (contiguous) digits.

Original entry on oeis.org

0, 1, 10, 11, 95, 96, 100, 101, 125, 976, 995, 996, 1000, 1001, 1025, 1376, 9625, 9976, 9995, 9996, 10000, 10001, 10025, 10376, 10625, 99376, 99625, 99976, 99995, 99996, 100000, 100001, 100025, 100376, 100625, 109376, 990625, 999376, 999625, 999976

Offset: 1

John "MazeMan" Knoderer (Webmaster(AT)Mazes.com)

All terms of this sequence appear in A086457. - Jeremy Gardiner, Jul 20 2003

It seems that for any nonnegative integer k the number of k-digit terms is 2k. - Ivan N. Ianakiev, Aug 17 2021

			95^2 = 9025 (insert '02' inside '95').

Reinhard Zumkeller, Table of n, a(n) for n = 1..100
J. Knoderer, What number comes next? (an interesting sequence)

Cf. A046851, A008851, A018834.

import Data.List (isPrefixOf, inits, isSuffixOf, tails)
a045953 n = a045953_list !! (n-1)
a045953_list = filter chi a008851_list where
   chi n = (x == y && xs `isSub'` ys) where
      x:xs = show $ div n 10
      y:ys = show $ div (n^2) 10
      isSub' us vs = any id $ zipWith (&&)
                              (map (`isPrefixOf` vs) $ inits us)
                              (map (`isSuffixOf` vs) $ tails us)
-- Reinhard Zumkeller, Jul 27 2011

A219190 Numbers of the form k(5k+1), where k = 0,-1,1,-2,2,-3,3,...

Original entry on oeis.org

0, 4, 6, 18, 22, 42, 48, 76, 84, 120, 130, 174, 186, 238, 252, 312, 328, 396, 414, 490, 510, 594, 616, 708, 732, 832, 858, 966, 994, 1110, 1140, 1264, 1296, 1428, 1462, 1602, 1638, 1786, 1824, 1980, 2020, 2184, 2226, 2398, 2442, 2622, 2668, 2856, 2904, 3100

Offset: 1

Bruno Berselli, Nov 14 2012

Equivalently, numbers m such that 20*m+1 is a square.
Also, integer values of h*(h+1)/5.
More generally, for the numbers of the form n*(k*n+1) with n in A001057, we have:
. generating function (offset 1): x^2*(k-1+2*x+(k-1)*x^2)/((1+x)^2*(1-x)^3);
. n-th term: b(n) = (2*k*n*(n-1)+(k-2)*(-1)^n*(2*n-1)+k-2)/8;
. first differences: (n-1)*((-1)^n*(k-2)+k)/2;
. b(2n+1)-b(2n) = 2*n (independent from k);
. (4*k)*b(n)+1 = (2*k*n+(k-2)*(-1)^n-k)^2/4.

Bruno Berselli, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Subsequence of A011858.
Cf. A090771: square roots of 20*a(n)+1 (see the first comment).
Cf. numbers of the form n*(k*n+1) with n in A001057: k=0, A001057; k=1, A110660; k=2, A000217; k=3, A152749; k=4, A074378; k=5, this sequence; k=6, A036498; k=7, A219191; k=8, A154260.
Cf. similar sequences listed in A219257.

k:=5; f:=func; [0] cat [f(n*m): m in [-1,1], n in [1..25]];

I:=[0,4,6,18,22]; [n le 5 select I[n] else Self(n-1)+2*Self(n-2)-2*Self(n-3)-Self(n-4)+Self(n-5): n in [1..50]]; // Vincenzo Librandi, Aug 18 2013

Rest[Flatten[{# (5 # - 1), # (5 # + 1)} & /@ Range[0, 25]]]
CoefficientList[Series[2 x (2 + x + 2 x^2) / ((1 + x)^2 (1 - x)^3), {x, 0, 50}], x] (* Vincenzo Librandi, Aug 18 2013 *)
LinearRecurrence[{1,2,-2,-1,1},{0,4,6,18,22},50] (* Harvey P. Dale, Jan 21 2015 *)

G.f.: 2*x^2*(2 + x + 2*x^2)/((1 + x)^2*(1 - x)^3).
a(n) = a(-n+1) = (10*n*(n-1) + 3*(-1)^n*(2*n - 1) + 3)/8.
a(n) = 2*A057569(n) = A008851(n+1)*A047208(n)/5.
a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5). - Harvey P. Dale, Jan 21 2015
Sum_{n>=2} 1/a(n) = 5 - sqrt(1+2/sqrt(5))*Pi. - Amiram Eldar, Mar 15 2022
a(n) = A132356(n-1)/2, n >= 1. - Bernard Schott, Mar 15 2022

A274913 Square array read by antidiagonals upwards in which each new term is the least positive integer distinct from its neighbors.

Original entry on oeis.org

1, 2, 3, 1, 4, 1, 2, 3, 2, 3, 1, 4, 1, 4, 1, 2, 3, 2, 3, 2, 3, 1, 4, 1, 4, 1, 4, 1, 2, 3, 2, 3, 2, 3, 2, 3, 1, 4, 1, 4, 1, 4, 1, 4, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3

Offset: 1

Omar E. Pol, Jul 11 2016

This is also a triangle read by rows in which each new term is the least positive integer distinct from its neighbors.
In the square array we have that:
Antidiagonal sums give the positive terms of A008851.
Odd-indexed rows give A010684.
Even-indexed rows give A010694.
Odd-indexed columns give A000034.
Even-indexed columns give A010702.
Odd-indexed antidiagonals give the initial terms of A010685.
Even-indexed antidiagonals give the initial terms of A010693.
Main diagonal gives A010685.
This is also a triangle read by rows in which each new term is the least positive integer distinct from its neighbors.
In the triangle we have that:
Row sums give the positive terms of A008851.
Odd-indexed columns give A000034.
Even-indexed columns give A010702.
Odd-indexed diagonals give A010684.
Even-indexed diagonals give A010694.
Odd-indexed rows give the initial terms of A010685.
Even-indexed rows give the initial terms of A010693.
Odd-indexed antidiagonals give the initial terms of A010684.
Even-indexed antidiagonals give the initial terms of A010694.

			The corner of the square array begins:
1, 3, 1, 3, 1, 3, 1, 3, 1, 3, ...
2, 4, 2, 4, 2, 4, 2, 4, 2, ...
1, 3, 1, 3, 1, 3, 1, 3, ...
2, 4, 2, 4, 2, 4, 2, ...
1, 3, 1, 3, 1, 3, ...
2, 4, 2, 4, 2, ...
1, 3, 1, 3, ...
2, 4, 2, ...
1, 3, ...
2, ...
...
The sequence written as a triangle begins:
1;
2, 3;
1, 4, 1;
2, 3, 2, 3;
1, 4, 1, 4, 1;
2, 3, 2, 3, 2, 3;
1, 4, 1, 4, 1, 4, 1;
2, 3, 2, 3, 2, 3, 2, 3;
1, 4, 1, 4, 1, 4, 1, 4, 1;
2, 3, 2, 3, 2, 3, 2, 3, 2, 3;
...

Cf. A000034, A008851, A010684, A010685, A010693, A010694, A010702, A274912, A274921.

Table[1 + Boole@ EvenQ@ # + 2 Boole@ EvenQ@ k &[n - k + 1], {n, 14}, {k, n}] // Flatten (* Michael De Vlieger, Nov 14 2016 *)

a(n) = A274912(n) + 1.

A151972 Numbers that are congruent to {0, 1, 6, 10} mod 15.

Original entry on oeis.org

0, 1, 6, 10, 15, 16, 21, 25, 30, 31, 36, 40, 45, 46, 51, 55, 60, 61, 66, 70, 75, 76, 81, 85, 90, 91, 96, 100, 105, 106, 111, 115, 120, 121, 126, 130, 135, 136, 141, 145, 150, 151, 156, 160, 165, 166, 171, 175, 180, 181, 186, 190, 195, 196, 201, 205, 210, 211, 216, 220, 225

Offset: 1

N. J. A. Sloane, Aug 23 2009

Also, numbers n such that n^2 - n is divisible by 15.

Also, numbers n such that n^2 - n is divisible by 30.

Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1).

For m^2 == m (mod n), see: n=2: A001477, n=3: A032766, n=4: A042948, n=5: A008851, n=6: A032766, n=7: A047274, n=8: A047393, n=9: A090570, n=10: A008851, n=11: A112651, n=12: A112652, n=13: A112653, n=14: A047274, n=15: A151972, n=16: A151977, n=17: A151978, n=18: A090570, n=19: A151979, n=20: A151980, n=21: A151971, n=22, A112651, n=24: A151973, n=26: A112653, n=30: A151972, n=32: A151983, n=34: A151978, n=38: A151979, n=42: A151971, n=48: A151981, n=64: A151984.

Cf. A215202.

[ n : n in [0..1000] | n mod 15 in [0, 1, 6, 10]]; // Vincenzo Librandi, Apr 02 2011, simplified by Eric M. Schmidt, Aug 05 2012

[ n: n in [0..1000] | (n^2-n) mod (15) eq 0 ]; // Vincenzo Librandi, Apr 03 2011, altered by Eric M. Schmidt, Aug 05 2012

A151972:=n->(30*n-41-5*I^(2*n)+(3+3*I)*I^(-n)+(3-3*I)*I^n)/8: seq(A151972(n), n=1..100); # Wesley Ivan Hurt, Jun 07 2016

Select[Range[0, 300], Divisible[#^2-#, 15]&]  (* Harvey P. Dale, Apr 01 2011, altered by Eric M. Schmidt, Aug 05 2012 *)

G.f.: x^2*(1+5*x+4*x^2+5*x^3) / ( (1+x)*(1+x^2)*(x-1)^2 ). - R. J. Mathar, Oct 25 2011
From Wesley Ivan Hurt, Jun 07 2016: (Start)
a(n) = (30*n-41-5*i^(2*n)+(3+3*i)*i^(-n)+(3-3*i)*i^n)/8 where i=sqrt(-1).
a(n) = a(n-1) + a(n-4) - a(n-5) for n>5. (End)
E.g.f.: (20 + (15*x - 23)*cosh(x) + 3*(sin(x) + cos(x) + (5*x - 6)*sinh(x)))/4. - Ilya Gutkovskiy, Jun 07 2016

This is a merge of two identical sequences, A151972 and A151975.

cp's OEIS Frontend

A191740 Dispersion of A047220, (numbers >1 and congruent to 0 or 1 or 3 mod 5), by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A191741 Dispersion of A047217, (numbers >1 and congruent to 0 or 1 or 2 mod 5), by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A046831 Numbers k such that decimal expansion of k^2 contains k as a substring and k does not end in 0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Python

A046851 Numbers n such that n^2 can be obtained from n by inserting internal (but not necessarily contiguous) digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

A301567 Expansion of Product_{k>=1} (1 + x^(5*k))*(1 + x^(5*k-4)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A086457 Both n and n^2 have the same initial digit and also n and n^2 have the same final digit when expressed in base 10.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

BASIC

Haskell

Mathematica

Formula

Extensions

A045953 Numbers m such that m^2 can be obtained from m by inserting an internal block of (contiguous) digits.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

A219190 Numbers of the form k*(5*k+1), where k = 0,-1,1,-2,2,-3,3,...

A301567 Expansion of Product_{k>=1} (1 + x^(5k))(1 + x^(5*k-4)).

A219190 Numbers of the form k(5k+1), where k = 0,-1,1,-2,2,-3,3,...