cp's OEIS Frontend

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.

A276714 Numbers n such that n and n+3 have the same number and sum of divisors (A000005 and A000203).

This page as a plain text file.
%I A276714 #13 Jul 12 2024 10:17:52
%S A276714 42677635,276742235,6439057062,7512673242,43592652562,48847956255,
%T A276714 48880963215,55018687182,60184185702,91484515395,100774916235,
%U A276714 101926379835,111886551315,122388340095,133012188855,137978601142,247631352255,263171068875,293467635615,305946896255
%N A276714 Numbers n such that n and n+3 have the same number and sum of divisors (A000005 and A000203).
%C A276714 Intersection of A015861 and A276713.
%C A276714 Also numbers n such that A229335(n) = A229335(n+3).
%H A276714 Martin Ehrenstein, <a href="/A276714/b276714.txt">Table of n, a(n) for n = 1..30</a>
%e A276714 42677635 is in sequence because tau(42677635) = tau(42677638) = 32 and sigma(42677635) = sigma(42677638) = 68769792.
%o A276714 (Magma) [n: n in [A015861(k)] | NumberOfDivisors(n) eq  NumberOfDivisors(n+3) and SumOfDivisors(n) eq  SumOfDivisors(n+3)]
%Y A276714 Cf. A015861, A229335, A276713, A276715.
%Y A276714 Cf. Similar sequences with numbers n such that n and n+k have the same number and sum of divisors for k=1: A054004, for k=2: A229254.
%K A276714 nonn
%O A276714 1,1
%A A276714 _Jaroslav Krizek_, Sep 16 2016
%E A276714 More terms from _Martin Ehrenstein_, Jul 12 2024